论文信息 - Completing Partial Latin Squares

Completing Partial Latin Squares

Abstract It is shown that if a partial latin square of order n with fewer than n entries has all its entries in no more than (n + 3) 2 rows, then it can be completed. This extends previous results of both Lindner and Wells, but lately Wells has improved this to (n + 5) 2 . We show that the number (n + 3) 2 is the best obtainable by the method of completing one row at a time without regard for completing future rows.

Charles Vanden Eynden | Richard Crittenden

[1] J. Schönheim,et al. Incomplete Diagonals of Latin Squares , 1969, Canadian Mathematical Bulletin.

[2] Albert L. Wells,et al. On the Completion of Partial Latin Squares , 1977, J. Comb. Theory A.

[3] T. Evans. Embedding Incomplete Latin Squares , 1960 .

[4] Albert L. Wells. On the Separation Power and the Completion of Partial Latin Squares , 1979, J. Comb. Theory, Ser. A.

[5] M. Hall. An existence theorem for latin squares , 1945 .

[7] C. Lindner. On Completing Latin Rectangles , 1970, Canadian Mathematical Bulletin.

[8] P. Hall. On Representatives of Subsets , 1935 .