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 such that there are graphs of arbitrarily large chromatic number and the same clique number as F in which every F-free induced subgraph has chromatic number at most cF. This generalises recent theorems of Briański, Davies a...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Springer Nature
2023
|