A survey of χ‐boundedness
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.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Aug 24, 2020
- Source ID
- 10.1002/jgt.22601
Entities
People
- Alexander David Scott
- Paul Seymour
Organizations
- Air Force Office of Scientific Research
- National Science Foundation
- Office of Naval Research
- Princeton University
- University of Oxford