A note on a conjecture of Gyárfás

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$.

arXiv comment7 pages, 5 figures