Journal title
Journal of Graph Theory
DOI
10.1002/jgt.22601
Issue
3
Volume
95
Last updated
2025-04-11T11:02:05.997+01:00
Page
473-504
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
On
Favourite
Off
Publication type
Journal Article
Publication date
24 Aug 2020