Asymptotic Enumeration of Graphs with a Given Upper Bound on the Maximum Degree

DOI10.1017/S0963548302005229zbMATH Open1001.05064MaRDI QIDQ3146986FDOQ3146986

Authors: Brendan D. McKay, Ian M. Wanless, Nicholas Wormald 

Publication date: 14 October 2002

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Recommendations

• The asymptotic number of graphs with a restriction on the maximum degree
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Asymptotic enumeration by degree sequence of graphs of high degree
• Asymptotic enumeration of graphs with given degree sequence
• The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices

zbMATH Keywords

degree sequenceasymptotic enumerationbinomial approximation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)

Cited In (11)

• On the asymptotics of degree structure of configuration graphs with bounded number of edges
• The asymptotic number of graphs with a restriction on the maximum degree
• Maximum number of symmetric extensions in random graphs
• Asymptotic Enumeration of Graph Classes with Many Components
• On perfectly friendly bisections of random graphs
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Asymptotic enumeration and limit laws of planar graphs
• Variable neighborhood search for extremal graphs. 12. A note on the variance of bounded degrees in graphs.
• Asymptotic enumeration of sparse graphs with a minimum degree constraint
• Asymptotic enumeration of graphs with given degree sequence
• Title not available (Why is that?)

This page was built for publication: Asymptotic Enumeration of Graphs with a Given Upper Bound on the Maximum Degree

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