Counting dense connected hypergraphs via the probabilistic method

DOI10.1002/rsa.20762zbMath1401.05144arXiv1511.04739OpenAlexW201940579MaRDI QIDQ4684827

Oliver Riordan, Béla Bollobás

Publication date: 25 September 2018

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

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

zbMATH Keywords

local limit theoremsrandom hypergraphshypergraph enumeration

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Enumeration in graph theory (05C30) Connectivity (05C40)

Related Items (3)

Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges ⋮ Phase transition in cohomology groups of non-uniform random simplicial complexes ⋮ Counting Connected Hypergraphs via the Probabilistic Method

This page was built for publication: Counting dense connected hypergraphs via the probabilistic method