Hasse-diagram chromatic number gap conjecture
Statement
Let be a Hasse diagram on vertices, and let denote its chromatic number. Hasse-diagram chromatic number gap conjecture. There exists such that
The paper proves a lower bound of order for the largest possible chromatic number of a Hasse diagram, while the general upper bound for triangle-free graphs is . Whether a power gap below always holds 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.