• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Article

Estimating the r-colorability threshold for a random hypergraph

Discrete Applied Mathematics. 2020. Vol. 282. P. 168-183.

The paper deals with estimating the r-colorability threshold for a random k-uniform hypergraph in the binomial model H(n,k,p). We consider the sparse case, when the expected number of edges is a linear function of n and prove a new lower bound for the sharp threshold of the property that  H(n,k,p) is r-colorable.