Threshold and hitting time for high-order connectedness in random hypergraphs

zbMath1339.05271arXiv1502.07289MaRDI QIDQ2629490

Christoph Koch, Mihyun Kang, Oliver Cooley

Publication date: 6 July 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.07289

zbMATH Keywords

connectivityhitting timerandom hypergraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Connectivity (05C40)

Related Items (5)

Generalizations and strengthenings of Ryser's conjecture ⋮ Phase transition in cohomology groups of non-uniform random simplicial complexes ⋮ Homological connectedness of random hypergraphs ⋮ Jigsaw percolation on random hypergraphs ⋮ Vanishing of cohomology groups of random simplicial complexes

Cites Work

• The size of the giant component in random hypergraphs: a short proof
• On the strength of connectedness of a random hypergraph
• Inside the critical window for cohomology of random k -complexes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Threshold and hitting time for high-order connectedness in random hypergraphs