Akbari–Alipour's unbounded gap conjecture for Latin arrays
Statement
Let be the least positive integer such that and every Latin array of order with at least distinct symbols contains a transversal. Akbari–Alipour's unbounded gap conjecture. For every integer , there exists a positive integer such that
This conjecture asserts that the number of distinct symbols needed to force a transversal can exceed the order by arbitrarily large amounts. The source gives no resolution, so its status remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.