On $r$-colorability of random hypergraphs

Andrei Kupavskii, Dmitry Shabanov

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 imp…