Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

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

Date

Authors

McKay, Brendan

Wanless, Ian

Wormald, Nicholas C

Publisher

Cambridge University Press

Abstract

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

Keywords

Keywords: Approximation theory; Asymptotic stability; Boundary conditions; Integration; Mathematical models; Normal distribution; Parameter estimation; Probability; Problem solving; Random processes; Theorem proving; Vectors; Binomial distributions; Euler-Maclaurin

URI

http://hdl.handle.net/1885/31230

Collections

ANU Research Publications

Source

Combinatorics Probability and Computing

Type

Journal article

DOI

10.1017/S0963548302005229

Restricted until

2037-12-31

Downloads

File

Description

01_McKay_Asymptotic_enumeration_of_2002.pdf (303.67 KB)

abcd