2000 character limit reached
On the number of symbols that forces a transversal
Published 28 May 2018 in math.CO and cs.DM | (1805.10911v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.