Asymptotic enumeration of graphs with a given bound on the maximum degree
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
|Collections||ANU Research Publications|
|Source:||Combinatorics Probability and Computing|
|01_McKay_Asymptotic_enumeration_of_2002.pdf||303.67 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.