Journal of Graph Theory· 2020Q1· Review
A survey of χ‐boundedness
- 140citations
- Q1SCImago
- 2020year
Short summary
This survey details recent progress on András Gyárfás's conjectures regarding the relationship between a graph's clique number, chromatic number, and its induced subgraphs.
AI-generated from the title and abstract; the full text is not read.
Key points
- The survey focuses on András Gyárfás's conjectures from the early 1980s.
- These conjectures link a graph's clique number, chromatic number, and induced subgraphs.
- Recent years have seen significant progress in addressing these conjectures.
- The paper provides an overview of the current state of research in this area.
AI-generated from the title and abstract; the full text is not read.
Abstract
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.
The authors' abstract, as published at the source. Journal of Graph Theory, 2020 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Discrete Mathematics and Combinatorics
Discrete Mathematics and CombinatoricsMathematics