Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path

DOI10.1007/S00493-023-00015-WarXiv2110.00278OpenAlexW3204767113MaRDI QIDQ6081401

P. D. Seymour, Alexander D. Scott, Sophie Spirkl

Publication date: 4 October 2023

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.00278

zbMATH Keywords

induced subgraphschromatic number\(P_5\)-free graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Coloring of some crown-free graphs ⋮ On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques ⋮ A note on the Gyárfás-Sumner conjecture ⋮ Divisibility and coloring of some \(P_5\)-free graphs ⋮ Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs ⋮ Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph

This page was built for publication: Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path