Journal title
Journal of Combinatorial Theory, Series B
DOI
10.1016/j.jctb.2018.03.006
Volume
132
Last updated
2024-04-10T05:44:13.903+01:00
Page
180-235
Abstract
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
Submitted to ORA
On
Favourite
On
Publication type
Journal Article
Publication date
06 Apr 2018