The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices

DOI10.1006/jcta.1997.2798zbMath0883.05071OpenAlexW2079236634MaRDI QIDQ1369735

Edward A. Bender, Brendan D. McKay, E. Rodney Canfield

Publication date: 23 February 1998

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1997.2798

zbMATH Keywords

asymptotic estimateenumerationlabeled graphEuler-Maclaurin summation

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (7)

Forbidden subgraphs in connected graphs ⋮ Asymptotic distribution of Bernoulli quadratic forms ⋮ Gaussian phases in generalized coupon collection ⋮ Unnamed Item ⋮ Asymptotic enumeration of sparse 2-connected graphs ⋮ Local limit theorems via Landau-Kolmogorov inequalities ⋮ Asymptotic enumeration of sparse graphs with a minimum degree constraint

Cites Work

• Asymptotic evaluation of the number of latin rectangles
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices