Applications of hypergraph coloring to coloring graphs not inducing certain trees

摘要

We present a simple result on coloring hypergraphs and use it to obtain bounds on the chromatic number of graphs which do not induce certain trees.