The chromatic-number bound for Latin square graphs
Statement
Let be a Latin square of order , and let denote the chromatic number of its Latin square graph. Then
The chromatic-number conjecture. Every Latin square satisfies
For this bound is established in the paper; the conjecture is presented as challenging even for Cayley tables of groups. It would imply the Brualdi–Stein and Ryser conjectures on long transversals.
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.