Let A be an m\_n matrix in which the entries of each row are all distinct. A. A. Drisko (1998, J. Combin. Theory Ser. A 84, 181 195) showed that if m 2n&1, then A has a transversal: a set of n distinct entries with no two in the same row or column. We generalize this to matrices with entries in the
A result on generalized latin rectangles
β Scribed by Chai-Ling Deng; Chong-Keang Lim
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 396 KB
- Volume
- 72
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
An alternative and simpler proof of the following result is given: Every r x s generalized partial latin rectangle Q on A = (1, 2, , k} can be extended to an n x n generalized latin square on A if and only if n 2 r + s -min{N(i) 1 i E A}, where N(i) denotes the number of times that the symbol i appears in Q.
π SIMILAR VOLUMES
It is shown that an m\_n row-latin rectangle with symbols in [1, 2, ..., k], k n, has a transversal whenever m 2n&1, and that this lower bound for m is sharp. Several applications are given. One is the construction of mappings which are generalizations of complete mappings. Another is the proof of a
The enumeration problem of Latin rectangles is formulated in terms of permanents, and two 'hard' inequalities of permanents are applied in a squeezing manner, both giving and suggesting asymptotic formulas.