On r-colorability of random hypergraphs
classification
🧮 math.CO
cs.DM
keywords
randomthresholdbinomialboundcolorabilitydealshypergraphhypergraphs
read the original abstract
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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.