2000 character limit reached
On $r$-colorability of random hypergraphs
Published 6 Oct 2011 in math.CO and cs.DM | (1110.1249v1)
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).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.