Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes

Author: 

Scott, A
Seymour, P

Publication Date: 

6 April 2018

Journal: 

Journal of Combinatorial Theory, Series B

Last Updated: 

2020-02-26T06:53:01.043+00:00

Volume: 

132

DOI: 

10.1016/j.jctb.2018.03.006

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: 

Submitted

Publication Type: 

Journal Article