Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph
We prove that for every path H $H$ , and every integer d $d$ , there is a polynomial f $f$ such that every graph G $G$ with chromatic number greater than f ( t ) $f(t)$ either contains H $H$ as an induced subgraph, or contains as a subgraph the complete d $d$ ‐partite graph with parts of cardinality...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Wiley
2024
|