Hypergraph coloring up to condensation

Random Structures and Algorithms, pp. 615-652, 2019.

Cited by: 6|Bibtex|Views2|Links
EI

Abstract:

Improving a result of Dyer, Frieze and Greenhill [Journal of Combinatorial Theory, Series B, 2015], we determine the $q$-colorability threshold in random $k$-uniform hypergraphs up to an additive error of $\ln 2+\varepsilon_q$, where $\lim_{q\to\infty}\varepsilon_q=0$. The new lower bound on the threshold matches the "condensation phase...More

Code:

Data:

Your rating :
0

 

Tags
Comments