A note on a conjecture of Gy\'arf\'as

zbMATH Open1164.05355arXiv1605.06638MaRDI QIDQ3428658FDOQ3428658

Authors: Ryan R. Martin 

Publication date: 29 March 2007

Abstract: This note proves that, given one member, $T$, of a particular family of radius-three trees, every radius-two, triangle-free graph, $G$, with large enough chromatic number contains an induced copy of $T$.

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

Recommendations

• Radius Three Trees in Graphs with Large Chromatic Number
• Induced subgraphs of graphs with large chromatic number. XII. Distant stars
• Chromatic number and subtrees of graphs
• scientific article; zbMATH DE number 6612443
• Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures

zbMATH Keywords

chromatic numberinduced treeGyárfás conjecture

Mathematics Subject Classification ID

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

Cited In (8)

• A note on Olsson's conjecture.
• Radius Three Trees in Graphs with Large Chromatic Number
• Title not available (Why is that?)
• On a conjecture of Givental
• A note on a conjecture of Wu, Xu and Xu
• Chromatic number and subtrees of graphs
• A note on the Gyárfás-Sumner conjecture
• Title not available (Why is that?)

This page was built for publication: A note on a conjecture of Gy\'arf\'as

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428658)