Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
We prove a conjecture of András Gyárfás, that for all k, ℓ, every graph with clique number at most κ and sufficiently large chromatic number has an odd hole of length at least ℓ.
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Elsevier
2019
|