Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes

Author: 

Chudnovsky, M
Scott, A
Seymour, P
Spirkl, S

Publication Date: 

16 May 2019

Journal: 

Journal of Combinatorial Theory, Series B

Last Updated: 

2020-09-28T04:01:54.443+01:00

Volume: 

140

DOI: 

10.1016/j.jctb.2019.05.001

page: 

84-97

abstract: 

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 ℓ.

Symplectic id: 

912188

Submitted to ORA: 

Submitted

Publication Type: 

Journal Article