A survey of χ ‐boundedness

@article{Scott2020ASO,
  title={A survey of 
$\chi$ ‐boundedness},
  author={Alex D. Scott and Paul D. Seymour},
  journal={Journal of Graph Theory},
  year={2020},
  volume={95},
  pages={473 - 504}
}
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. 
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number
We prove that for every n , there is a graph G with χ ( G ) ≥ n and ω ( G ) ≤ 3 such that every induced subgraph H of G with ω ( H ) ≤ 2 satisfies χ ( H ) ≤ 4. This disproves a well-known conjecture.
Chordal directed graphs are not directed χ -bounded
We show that digraphs with no transitive tournament on 3 vertices and in which every induced directed cycle has length 3 can have arbitrarily large dichromatic number. This answers in the negative a
Induced subgraphs of induced subgraphs of large chromatic number
We prove that, for every graph F with at least one edge, there is a constant cF such that there are graphs of arbitrarily large chromatic number and the same clique number as F in which every F -free
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
Let H be a tree. It was proved by Rödl that graphs that do not contain H as an induced subgraph, and do not contain the complete bipartite graph K t,t as a subgraph, have bounded chromatic number.
Improved bounds for colouring circle graphs
TLDR
The first χ-bounding function for circle graphs that is optimal up to a constant factor is proved, and it is proved that every circle graph with clique number at most ω has chromatic number at least 2ω.
Induced subgraphs of graphs with large chromatic number. XIV. Excluding a biclique and an induced tree
Let H be a tree. It was proved by Rödl that graphs that do not contain H as an induced subgraph, and do not contain the complete bipartite graphKt,t as a subgraph, have bounded chromatic number.
Chordal Directed Graphs Are Not $\chi$-Bounded
We show that digraphs with no transitive tournament on $3$ vertices and in which every induced directed cycle has length $3$ can have arbitrarily large dichromatic number. This answers in the
Triangle-free graphs with large chromatic number and no induced wheel
A wheel is a graph consisting of an induced cycle of length at least four and a single additional vertex with at least three neighbours on the cycle. We prove that no Burling graph contains an
Polynomial bounds for chromatic number. IV. A near-polynomial bound for excluding the five-vertex path
A graph G is H-free if it has no induced subgraph isomorphic to H. We prove that a P5-free graph with clique number ω ≥ 3 has chromatic number at most ωlog2(ω). The best previous result, due to
Polynomial bounds for chromatic number. III. Excluding a double star
A “double star” is a tree with two internal vertices. It is known that the Gyárfás-Sumner conjecture holds for double stars, that is, for every double star H , there is a function f H such that if G
...
...

References

SHOWING 1-10 OF 195 REFERENCES
Graphs with large chromatic number induce $3k$-cycles
TLDR
It is proved that graphs without induced cycles of length 3k have bounded chromatic number, which implies the very first case of a much broader question asserting that every graph with large Chromatic number induces a graph H such that the sum of the Betti numbers of the independence complex of H is also large.
Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes
We prove a 1985 conjecture of Gyárfás that for all k, ℓ, every graph with sufficiently large chromatic number contains either a clique of cardinality more than k or an induced cycle of length more
On bounding the chromatic number of L-graphs
Recognizing Berge Graphs
TLDR
This paper gives an algorithm to test if a graph G is Berge, with running time O(|V (G)|9), independent of the recent proof of the strong perfect graph conjecture.
A short proof of the existence of highly chromatic hypergraphs without short cycles
A bound on the chromatic number of graphs without certain induced subgraphs
  • S. Wagon
  • Mathematics
    J. Comb. Theory, Ser. B
  • 1980
Induced subgraphs of graphs with large chromatic number. XI. Orientations
...
...