Projects per year
Abstract
A Latin array is a matrix of symbols in which no symbol occurs more than once within a row or within a column. A diagonal of an n × n array is a selection of (Formula presented.) cells taken from different rows and columns of the array. The weight of a diagonal is the number of different symbols on it. We show via computation that every Latin array of order (Formula presented.) has a diagonal of weight at least (Formula presented.). A corollary is the existence of near transversals in Latin squares of these orders. More generally, for all (Formula presented.) we compute a lower bound on the order of any Latin array that does not have a diagonal of weight at least (Formula presented.).
Original language | English |
---|---|
Pages (from-to) | 511-527 |
Number of pages | 17 |
Journal | Journal of Combinatorial Designs |
Volume | 29 |
Issue number | 8 |
DOIs | |
Publication status | Published - Jul 2021 |
Keywords
- Brualdi's conjecture
- Latin array
- Latin square
- near transversal
- partial transversal
Projects
- 1 Finished
-
Matchings in Combinatorial Structures
Wanless, I. (Primary Chief Investigator (PCI)), Bryant, D. (Chief Investigator (CI)) & Horsley, D. (Chief Investigator (CI))
ARC - Australian Research Council, Monash University, University of Queensland , University of Melbourne
1/01/15 → 10/10/20
Project: Research