On the Number of Mutually Orthogonal Partial Latin Squares

Khaled A.S. Abdel-Ghaffar1
1 Department of Electrical and Computer Engineering University of California Davis, CA 95616 USA

Abstract

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.