  The work deals with the threshold probablity for r-colorability in the
binomial model H(n,k,p) of a random k-uniform hypergraph. We prove a lower
bound for this threshold which improves the previously known results in the
wide range of the parameters r=r(n) and k=k(n).
