2000 character limit reached
On the number of symbols that forces a transversal (1805.10911v1)
Published 28 May 2018 in math.CO and cs.DM
Abstract: Akbari and Alipour conjectured that any Latin array of order $n$ with at least $n2/2$ symbols contains a transversal. We confirm this conjecture for large $n$, and moreover, we show that $n{399/200}$ symbols suffice.