Polynomial bounds for chromatic number II: Excluding a star‐forest

DOI10.1002/JGT.22829zbMath1521.05046arXiv2107.11780OpenAlexW3186740737WikidataQ114236135 ScholiaQ114236135MaRDI QIDQ6057629

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

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

colouringchromatic numberinduced subgraph\(\chi\)-boundednessGyárfás-Sumner conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Polynomial bounds for chromatic number VII. Disjoint holes ⋮ Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph ⋮ Hitting all maximum stable sets in \(P_5\)-free graphs ⋮ Polynomial bounds for chromatic number VI. Adding a four-vertex path

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey-type theorems
• A bound on the chromatic number of graphs without certain induced subgraphs
• Induced subtrees in graphs of large chromatic number
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
• Induced subgraphs of graphs with large chromatic number. XIII. New brooms
• Towards Erdős-Hajnal for graphs with no 5-hole
• Radius two trees specify χ‐bounded classes
• Radius Three Trees in Graphs with Large Chromatic Number
• On the chromatic number of (P_{5},windmill)-free graphs
• A survey of χ‐boundedness
• Induced subgraphs of graphs with large chromatic number. XII. Distant stars
• Polynomial bounds for chromatic number. III. Excluding a double star
• Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs

This page was built for publication: Polynomial bounds for chromatic number II: Excluding a star‐forest