Let $k\ge 4$ and let $f_k(n)$ be the largest $m$ such that there is a graph on $n$ vertices with chromatic number $k$ in which every odd cycle has length $>m$. Is it true that$$f_k(n)\asymp n^{\frac{1}{k-2}}?$$