Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph
We prove that for every path H, and every integer d, there is a polynomial f such that every graph G with chromatic number greater than f(t) either contains H as an induced subgraph, or contains as a subgraph the complete d-partite graph with parts of cardinality t. For t = 1 and general d this is a...
Glavni autori: | Nguyen, T, Scott, AD, Seymour, P |
---|---|
Format: | Journal article |
Jezik: | English |
Izdano: |
Wiley
2024
|
Slični predmeti
-
Polynomial bounds for chromatic number VIII. Excluding a path and a complete multipartite graph
od: Nguyen, T, i dr.
Izdano: (2024) -
Polynomial bounds for chromatic number. V. Excluding a tree of radius two and a complete multipartite graph
od: Scott, A, i dr.
Izdano: (2023) -
Polynomial bounds for chromatic number. iv: a near-polynomial bound for excluding the five-vertex path
od: Scott, A, i dr.
Izdano: (2023) -
Polynomial bounds for chromatic number II: excluding a star-forest
od: Scott, A, i dr.
Izdano: (2022) -
Polynomial bounds for chromatic number III: excluding a double star
od: Scott, A, i dr.
Izdano: (2022)