A survey of chi-boundedness

Author: 

Scott, A
Seymour, P

Publication Date: 

24 August 2020

Journal: 

Journal of Graph Theory

Last Updated: 

2020-10-23T18:56:00.74+01:00

DOI: 

10.1002/jgt.22601

abstract: 

If a graph has bounded clique number and sufficiently large chromatic number, what can we say about its induced subgraphs? András Gyárfás made a number of challenging conjectures about this in the early 1980s, which have remained open until recently; but in the last few years there has been substantial progress. This is a survey of where we are now.

Symplectic id: 

1107483

Submitted to ORA: 

Submitted

Publication Type: 

Journal Article