Towards a solution of the dinitz problem
β
Roland HΓ€ggkvist
π
Article
π
1989
π
Elsevier Science
π
English
β 276 KB
An r x n latin rectangle is an r X n array filled with m symbols, say, such that every cell contains one symbol and every symbol occurs at most once in each row and column. The purpose of this paper is to prove the following result. Theorem. Let L = (Li,i) be an r X n array of n-sets with r < $n.