Erdős Problem #58 — Chromatic number from the number of odd cycle lengths
Statement
If a graph contains odd cycles of at most different lengths, must , with equality only when contains ?
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.