Seminars and Colloquiums

The Gyárfás-Sumner conjecture says that for every forest $H$, there is a function $f$ such that the chromatic number $\chi (G)$ is at most $f(\omega (G))$ for every $H$-free graph $G$ ("$H$-free" means with …