Publication Date:
September 2018
Journal:
JOURNAL OF COMBINATORIAL THEORY SERIES B
Last Updated:
2020-01-05T10:32:36.137+00:00
Volume:
132
DOI:
10.1016/j.jctb.2018.03.006
page:
180-235
abstract:
© 2018 Elsevier Inc. 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.
Symplectic id:
832463
Download URL:
Submitted to ORA:
Submitted
Publication Type:
Journal Article