Homological connectedness of random hypergraphs

DOI10.1016/J.ENDM.2017.06.049zbMath1378.05182arXiv1604.00842OpenAlexW2743124206MaRDI QIDQ1689925

Mihyun Kang, Oliver Cooley, Philipp Sprüssel, Penny E. Haxell

Publication date: 18 January 2018

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

zbMATH Keywords

connectednessphase transitionsimplicial complexeshitting timerandom hypergraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Connectivity (05C40) Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Unnamed Item
• Unnamed Item
• Homological connectivity of random 2-complexes
• On the strength of connectedness of a random hypergraph
• Threshold and hitting time for high-order connectedness in random hypergraphs
• Inside the critical window for cohomology of random k -complexes

This page was built for publication: Homological connectedness of random hypergraphs