The size of the giant high‐order component in random hypergraphs

DOI10.1002/rsa.20761zbMath1401.05202OpenAlexW2792242268MaRDI QIDQ4684829

Oliver Cooley, Mihyun Kang, Christoph Koch

Publication date: 25 September 2018

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20761

zbMATH Keywords

phase transitiondegreebranching processrandom hypergraphsgiant componenthigh-order connectedness

Mathematics Subject Classification ID

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

Related Items (8)

Generalizations and strengthenings of Ryser's conjecture ⋮ Phase transition in cohomology groups of non-uniform random simplicial complexes ⋮ Subcritical Random Hypergraphs, High-Order Components, and Hypertrees ⋮ Forcing large tight components in 3-graphs ⋮ Longest Paths in Random Hypergraphs ⋮ The size of the giant component in random hypergraphs: a short proof ⋮ Largest Components in Random Hypergraphs ⋮ Loose cores and cycles in random hypergraphs

This page was built for publication: The size of the giant high‐order component in random hypergraphs