Induced subgraphs of graphs with large chromatic number. XIII. New brooms

DOI10.1016/j.ejc.2019.103024zbMath1428.05118arXiv1807.03768OpenAlexW2978867875WikidataQ127178183 ScholiaQ127178183MaRDI QIDQ2011144

P. D. Seymour, Alexander D. Scott

Publication date: 28 November 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

handles\((k_1, \ldots, k_n)\)-multibroomGyárfás-Sumner conjecture

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree ⋮ Polynomial bounds for chromatic number II: Excluding a star‐forest ⋮ Polynomial bounds for chromatic number. III. Excluding a double star ⋮ A note on the Gyárfás-Sumner conjecture ⋮ Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs ⋮ Graphs of large chromatic number ⋮ Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\) ⋮ Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induced subtrees in graphs of large chromatic number
• Applications of hypergraph coloring to coloring graphs not inducing certain trees
• Radius two trees specify χ‐bounded classes
• Radius Three Trees in Graphs with Large Chromatic Number
• Induced subgraphs of graphs with large chromatic number. XII. Distant stars
• Nombre chromatique et plus longs chemins d'un graphe

This page was built for publication: Induced subgraphs of graphs with large chromatic number. XIII. New brooms