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.
Original language | American English |
---|---|
Pages (from-to) | 473-504 |
Number of pages | 32 |
Journal | Journal of Graph Theory |
Volume | 95 |
Issue number | 3 |
DOIs | |
State | Published - Nov 1 2020 |
ASJC Scopus subject areas
- Geometry and Topology
Keywords
- colouring
- χ-boundedness