On $r$-colorability of random hypergraphs
Combinatorics
2017-12-01 v1 Discrete Mathematics
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).
Cite
@article{arxiv.1110.1249,
title = {On $r$-colorability of random hypergraphs},
author = {Andrei Kupavskii and Dmitry Shabanov},
journal= {arXiv preprint arXiv:1110.1249},
year = {2017}
}
Comments
32 pages