Erdős Problem #63 — Power-of-two cycles in infinitely chromatic graphs
Must every graph of infinite chromatic number contain cycles of length for infinitely many integers ?
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.