Erdős Problem #57 — Reciprocals of odd cycle lengths in infinitely chromatic graphs
Statement
If an infinite graph has infinite chromatic number and are the lengths of its odd cycles, must diverge?
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.