Logo
All Random Solved Random Open
SOLVED
Does every graph $G$ with chromatic number $\geq \aleph_1$ contain all sufficiently large odd cycles?
A problem of Erdős and Hajnal. This was proved by Erdős, Hajnal, and Shelah [EHS74].

See also [593].