A strengthening on odd cycles in graphs of given chromatic number

Jun Gao, Qingyi Huo, Jie Ma

Resolving a conjecture of Bollobás and Erdős, Gyárfás proved that every graph $G$ of chromatic number $k+1\ge 3$ contains cycles of $\lfloor \frac{k}{2}\rfloor$ distinct odd length…