Subcritical random hypergraphs, high-order components, and hypertrees

DOI10.1137/1.9781611975505.12zbMath1433.05236arXiv1810.08107OpenAlexW3092441220MaRDI QIDQ5195239

Nicola Del Giudice, Oliver Cooley, Mihyun Kang, Wenjie Fang

Publication date: 18 September 2019

Published in: 2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

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

zbMATH Keywords

binomial random \(k\)-uniform hypergraphgiant \(j\)-connected component

Mathematics Subject Classification ID

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

This page was built for publication: Subcritical random hypergraphs, high-order components, and hypertrees