Counting connected graphs and hypergraphs via the probabilistic method

DOI10.1002/rsa.20160zbMath1129.05019MaRDI 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 graphs; connectivity; probabilistic method; random hypergraphs; giant component

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C65: Hypergraphs

05C30: Enumeration in graph theory

05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)

Related Items

Swendsen‐Wang algorithm on the mean‐field Potts model, ‘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, The Asymptotic Number of Connectedd-Uniform Hypergraphs, Birth and growth of multicyclic components in random hypergraphs, Strictly balanced uniform hypergraphs and generalizations of zero-one law, Counting sparse \(k\)-edge-connected hypergraphs with given number of vertices and edges, The order of the giant component of random hypergraphs, Asymptotic normality of the size of the giant component in a random hypergraph