Counting connected graphs inside-out
type: Item
instance of: scholarly article
title: Counting connected graphs inside-out
zbMATH Open document ID: 1057.05044
author: Nicholas Wormald
author: Boris Pittel
published in: Journal of Combinatorial Theory. Series B
publication date: 2005-03-08T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05A16
zbMATH DE Number: 2142246
zbMATH Keywords: Enumeration
zbMATH Keywords: Core
zbMATH Keywords: Connected
zbMATH Keywords: Asymptotics
zbMATH Keywords: Limit distributions
zbMATH Keywords: Giant component
zbMATH Keywords: Random graph
MaRDI profile type: Publication
full work available at URL: j.jctb.2004.09.005
OpenAlex ID: W2036312115
cites work: Q4385084
cites work: Q4401944
cites work: The asymptotic number of labeled graphs with given degree sequences
cites work: The asymptotic number of labeled connected graphs with a given number of vertices and edges
cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
cites work: The Evolution of Random Graphs
cites work: Q3286850
cites work: The birth of the giant component
cites work: Q4519896
cites work: The phase transition in a random hypergraph
cites work: Component behavior near the critical point of the random graph process
cites work: Cycles in a random graph near the critical point
cites work: Q4697461
cites work: Q3684147
cites work: On tree census and the giant component in sparse random graphs
cites work: Asymptotic enumeration of sparse graphs with a minimum degree constraint
cites work: Q3777141
cites work: The asymptotic connectivity of labelled regular graphs
cites work: The number of connected sparsely edged graphs
cites work: FORMULAE FOR THE NUMBER OF SPARSELY-EDGED STRONG LABELLED DIGRAPHS
cites work: The number of connected sparsely edged graphs. II. Smooth graphs and blocks
DOI: 10.1016/J.JCTB.2004.09.005
description: scientific article; zbMATH DE number 2142246