Skip navigation
Skip navigation

Asymptotic enumeration of graphs with a given bound on the maximum degree

McKay, Brendan; Wanless, Ian; Wormald, Nicholas C


Consider the class of graphs on n vertices which have maximum degree at most 1/2 n - 1 + τ, where τ ≥ - n1/2+ε for sufficiently small ε > 0. We find an asymptotic formula for the number of such graphs and show that their number of edges has a normal

CollectionsANU Research Publications
Date published: 2002
Type: Journal article
Source: Combinatorics Probability and Computing
DOI: 10.1017/S0963548302005229


File Description SizeFormat Image
01_McKay_Asymptotic_enumeration_of_2002.pdf303.67 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator