Polynomial bounds for chromatic number. III. Excluding a double star

DOI10.1002/JGT.22862zbMath1521.05047arXiv2108.07066OpenAlexW3193424040WikidataQ114236122 ScholiaQ114236122MaRDI QIDQ6057630

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

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/2108.07066

zbMATH Keywords

induced subgraphchi-boundednessGyárfás-Sumner conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Polynomial bounds for chromatic number II: Excluding a star‐forest ⋮ Polynomial bounds for chromatic number VII. Disjoint holes ⋮ A note on the Gyárfás-Sumner conjecture ⋮ Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph ⋮ Polynomial \(\chi\)-binding functions for \(t\)-broom-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
• Induced subtrees in graphs of large chromatic number
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
• Defective and clustered graph colouring
• Induced subgraphs of graphs with large chromatic number. XIII. New brooms
• Graph Theory and Probability
• Radius two trees specify χ‐bounded classes
• Radius Three Trees in Graphs with Large Chromatic Number
• A survey of χ‐boundedness
• Induced subgraphs of graphs with large chromatic number. XII. Distant stars
• Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs

This page was built for publication: Polynomial bounds for chromatic number. III. Excluding a double star