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

DOI10.1017/S0963548302005229zbMath1001.05064MaRDI QIDQ3146986

Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald

Publication date: 14 October 2002

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

zbMATH Keywords

asymptotic enumerationdegree sequencebinomial approximation

Mathematics Subject Classification ID

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