The Asymptotic Number of Connectedd-Uniform Hypergraphs

DOI10.1017/S0963548314000029zbMath1288.05243OpenAlexW2093738698MaRDI QIDQ5418807

Mihyun Kang, Michael Behrisch, Amin Coja-Oghlan

Publication date: 28 May 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548314000029

Mathematics Subject Classification ID

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

Related Items (4)

Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges ⋮ On vertex independence number of uniform hypergraphs ⋮ ‘The Asymptotic Number of Connected d-Uniform Hypergraphs’ — CORRIGENDUM ⋮ Counting Connected Hypergraphs via the Probabilistic Method

Cites Work

• Counting connected graphs asymptotically
• Component structure in the evolution of random hypergraphs
• The number of connected sparsely edged uniform hypergraphs
• Some large deviation results for sparse random graphs
• Counting connected graphs inside-out
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• On the number of sparse connected graphs
• Asymptotic properties of labeled connected graphs
• Counting connected graphs and hypergraphs via the probabilistic method
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$

This page was built for publication: The Asymptotic Number of Connectedd-Uniform Hypergraphs