Latin transversals of rectangular arrays
| dc.creator | Stein, Sherman K. | |
| dc.date | 2001-07-09 | |
| dc.date | 2001-09-18 | |
| dc.date.accessioned | 2026-07-07T04:42:32Z | |
| dc.date.available | 2026-07-07T04:42:32Z | |
| dc.description | Let m and n be integers, $2 \leq m \leq n$. An m by n array consists of mn cells, arranged in m rows and n columns, and each cell contains exactly one symbol. A transversal of an array consists of m cells, one from each row and no two from the same column. A latin transversal is a transversal in which no symbol appears more than once. We will establish a sufficient condition that a 3 by n array has a latin transversal. | |
| dc.description | Theorem 4 has been added, which provides a lower bound on L(m,n) | |
| dc.identifier | https://arxiv.org/abs/math/0107066 | |
| dc.identifier | http://arxiv.org/abs/math/0107066 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/61823 | |
| dc.subject | Combinatorics | |
| dc.title | Latin transversals of rectangular arrays | |
| dc.type | text |