On the concentration of the chromatic number of a random hypergraph
Dmitry Aleksandrovich Shabanov · Doklady Mathematics · 2017
The problem on the limit distribution of the chromatic number of a random uniform hypergraph in the sparse case is studied. It is shown that, for most parameters values, the limit distribution of the chromatic number is concentrated at precisely one point, which can be found explicitly.