Asymptotic enumeration of graphs with a given bound on the maximum degree
Date
2002
Authors
McKay, Brendan
Wanless, Ian
Wormald, Nicholas C
Journal Title
Journal ISSN
Volume Title
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
Description
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
Citation
Collections
Source
Combinatorics Probability and Computing
Type
Journal article
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description