Counting connected graphs and hypergraphs via the probabilistic method

DOI10.1002/rsa.20160zbMath1129.05019OpenAlexW1499020887MaRDI QIDQ5433264

Vishal Sanwalani, Amin Coja-Oghlan, Moore, Cristopher

Publication date: 8 January 2008

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

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

zbMATH Keywords

random graphsconnectivityprobabilistic methodrandom hypergraphsgiant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Enumeration in graph theory (05C30) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (10)

Strictly balanced uniform hypergraphs and generalizations of zero-one law ⋮ Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges ⋮ Birth and growth of multicyclic components in random hypergraphs ⋮ ‘The Asymptotic Number of Connected d-Uniform Hypergraphs’ — CORRIGENDUM ⋮ Counting Connected Hypergraphs via the Probabilistic Method ⋮ Local Limit Theorems for the Giant Component of Random Hypergraphs ⋮ Swendsen‐Wang algorithm on the mean‐field Potts model ⋮ The Asymptotic Number of Connectedd-Uniform Hypergraphs ⋮ The order of the giant component of random hypergraphs ⋮ Asymptotic normality of the size of the giant component in a random hypergraph

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