On the number of symbols that forces a transversal

Abstract

Akbari and Alipour conjectured that any Latin array of order $n$ with at least $n^2/2$ symbols contains a transversal. We confirm this conjecture for large $n$, and moreover, we show that $n^{399/200}$ symbols suffice.

6 pages, 1 figure

Cited by in corpus (2)

• Decompositions into spanning rainbow structures
• Full rainbow matchings in graphs and hypergraphs