Tags
Prizes
More
FAQ
Problem Lists
Definitions
Links
How to help
Go
Go
All
Random Solved
Random Open
SOLVED
Does every graph $G$ with chromatic number $\geq \aleph_1$ contain all sufficiently large odd cycles?
#594
:
[ErHa66]
graph theory
,
set theory
A problem of Erdős and Hajnal. This was proved by Erdős, Hajnal, and Shelah
[EHS74]
.
See also
[593]
and
[737]
.
Previous
Next