In this talk, we show that every 4-chromatic graph
on n vertices contains an odd cycle of length at most 2\sqrt{n}.
This improves the previous bound \sqrt{8n} by A. Nilli.

We will also construct, for infinitely many values of n,
4-chromatic graphs containing no odd cycle of length less
than \sqrt{2n}. The construction is due to various authors.