arXiv Analytics

Sign in

arXiv:1110.1249 [math.CO]AbstractReferencesReviewsResources

On $r$-colorability of random hypergraphs

Andrei Kupavskii, Dmitry Shabanov

Published 2011-10-06Version 1

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).

Comments: 32 pages
Categories: math.CO
Subjects: 05C15, 05C80
Related articles: Most relevant | Search more
arXiv:1207.3319 [math.CO] (Published 2012-07-13)
Lower bound for the rank of rigidity matrix of 4-valent graphs under various connectivity assumptions
arXiv:1309.3625 [math.CO] (Published 2013-09-14, updated 2014-03-14)
A Lower Bound on the Crossing Number of Uniform Hypergraphs
arXiv:math/9805066 [math.CO] (Published 1998-05-13)
A Lower Bound for Partial List Colorings

Links

Toolbox