# odd hole

## Bounding the chromatic number of graphs with no odd hole ★★★

Author(s): Gyarfas

\begin{conjecture} There exists a fixed function $f : {\mathbb N} \rightarrow {\mathbb N}$ so that $\chi(G) \le f(\omega(G))$ for every graph $G$ with no odd hole. \end{conjecture}