Erdős Problem #57 — Reciprocals of odd cycle lengths in infinitely chromatic graphs
If an infinite graph has infinite chromatic number and are the lengths of its odd cycles, must diverge?
References
Primary source
Additional references
P. Erdős, Some of my favourite problems in number theory, combinatorics, and geometry, Resenhas 2 (1995), 165–186.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.