Erdős Problem #594

Does every graph $G$ with chromatic number $\geq \aleph_1$ contain all sufficiently large odd cycles?

graph theory | set theory

A problem of Erdős and Hajnal (who proved this for chromatic number $\geq \aleph_2$). This was proved by Erdős, Hajnal, and Shelah [EHS74].

See also [593] and [737].

View the LaTeX source

External data from the database - you can help update this
Formalised statement? No (Create a formalisation here)

0 comments on this problem

Likes this problem	None
Interested in collaborating	None
Currently working on this problem	None
This problem looks difficult	None
This problem looks tractable	None

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #594, https://www.erdosproblems.com/594, accessed 2026-01-16