On the limit concentration of the values of chromatic numbers of random hypergraphs

The paper deals with the asymptotic behavior of j-chromatic numbers of random к-uniform hypergraphs in the uniform model. We consider the so-called «nonsparse» case when the number of edges grows faster than the number of vertices. It is proved that in a certain range of parameter changes there is a limit concentration of the values of j-chromatic numbers in some bounded set.