Non-concentration of the chromatic number of a random graph

Abstract

We show that the chromatic number of $G_{n,\frac{1}{2}}$ is not concentrated on fewer than $n^{\frac{1}{4}-\epsilon }$ consecutive values. This addresses a longstanding question raised by Erdős and several other authors.

14 pages, 1 figure. To appear in JAMS