  Answering a question by Letzter and Snyder, we prove that for large enough
$k$ any $n$-vertex graph $G$ with minimum degree at least $\frac{1}{2k-1}n$ and
without odd cycles of length less than $2k+1$ is $3$-colourable. In fact, we
prove a stronger result that works with a slightly smaller minimum degree.
