Claims

../

1966_03_01_erdos_hajnal: Erdős and Hajnal (Acta Math. Acad. Sci. Hungar. 17, 1966) state, without proof, that a graph of chromatic number above omega_2 contains all sufficiently long odd circuits, the question of Problem 594 in a special case.

1974_01_01_erdos_hajnal_shelah: Erdős, Hajnal and Shelah prove that every graph of chromatic number greater than aleph_0 contains odd cycles of every sufficiently large length, the statement of Problem 594, as Theorem 3 of their 1974 paper.

---