An upper bound on the size of any collection of mutually orthogonal partial Latin squares is derived as a function of the number of compatible cells that are occupied in all squares. It is shown that the bound is strict if the number of compatible cells is small.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.