Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes
A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for all ν > 0, every triangle-free graph with sufficiently large chromatic number contains holes of ν consecutive lengths.
| Главные авторы: | , |
|---|---|
| Формат: | Journal article |
| Опубликовано: |
Elsevier
2018
|