Non-concentration of the chromatic number of a random graph
Combinatorics
2021-03-29 v2
Abstract
We show that the chromatic number of is not concentrated on fewer than consecutive values. This addresses a longstanding question raised by Erd\H{o}s and several other authors.
Cite
@article{arxiv.1906.11808,
title = {Non-concentration of the chromatic number of a random graph},
author = {Annika Heckel},
journal= {arXiv preprint arXiv:1906.11808},
year = {2021}
}
Comments
14 pages, 1 figure. To appear in JAMS