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

DOI10.1006/JCTA.1997.2798zbMATH Open0883.05071OpenAlexW2079236634MaRDI QIDQ1369735FDOQ1369735

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

Recommendations

• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• Asymptotic Enumeration of Graphs with a Given Upper Bound on the Maximum Degree
• Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities
• The asymptotic number of graphs with a restriction on the maximum degree

zbMATH Keywords

enumerationasymptotic estimatelabeled graphEuler-Maclaurin summation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• Asymptotic evaluation of the number of latin rectangles

Cited In (17)

• Asymptotic enumeration of sparse 2-connected graphs
• Title not available (Why is that?)
• Asymptotic Enumeration of Graphs with a Given Upper Bound on the Maximum Degree
• Labelled graphs with vertices of degree at least three
• Title not available (Why is that?)
• Asymptotic distribution of Bernoulli quadratic forms
• Forbidden subgraphs in connected graphs
• Gaussian phases in generalized coupon collection
• Local limit theorems via Landau-Kolmogorov inequalities
• Title not available (Why is that?)
• Enumerating labelled graphs with certain neighborhood properties
• Asymptotic enumeration of sparse graphs with a minimum degree constraint
• Aspects of asymptotic graph theory
• Asymptotic enumeration of full graphs
• Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369735)