ON THE CHROMATIC NUMBERS OF RANDOM HYPERGRAPHS
The asymptotic behaviour of the chromatic number of the binomial random hypergraph $H(n,k,p)$ for fixed $k \geqslant 4$, for <i>n</i> tending to infinity and for some function $p = p(n)$ is studied. For not very slowly decreasing function $p = p(n)$ we prove that the chromatic number of the random hypergraph $H(n,k,p)$ is concentrated in two or three consecutive values which can be found explicitly as functions of <i>n</i>, <i>p</i>, <i>k</i>.