Polynomial bounds for chromatic number. II. Excluding a star-forest

Abstract

The Gyarfas-Sumner conjecture says that for every forest $H$, there is a function $f$ such that if $G$ is $H$-free then $\ddot{I}‡(G)\le f(\ddot{I}‰(G))$ (where $\ddot{I}‡,\ddot{I}‰$ are the chromatic number and the clique number of $G$). Louis Esperet conjectured that, whenever such a statement holds, $f$ can be chosen to be a polynomial. The Gyarfas-Sumner conjecture is only known to be true for a modest set of forests $H$, and Esperet's conjecture is known to be true for almost no forests. For instance, it is not known when $H$ is a five-vertex path. Here we prove Esperet's conjecture when each component of $H$ is a star.