Circumference, Chromatic Number and Online Coloring

Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan

Erdös conjectured that if $G$ is a triangle free graph of chromatic number at least $k\ge 3$, then it contains an odd cycle of length at least $k^{2-o(1)}$ \cite{sudakovverstraete…