Title of article
The Asymptotic Number of Labeled Graphs withnVertices,qEdges, and No Isolated Vertices
Author/Authors
Bender، نويسنده , , Edward A and Rodney Canfield، نويسنده , , E and McKay، نويسنده , , Brendan D، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
27
From page
124
To page
150
Abstract
Letd(n, q) be the number of labeled graphs withnvertices, q\le N={n \choose 2} edges, and no isolated vertices. Letx=q/nandk=2q−n. We determine functionswk∼1,a(x), andϕ(x) such that d(n,\ q)\sim w_k{N \choose q}\ e^{n\varphi (x)+a(x)} uniformly for allnandq>n/2.
Journal title
Journal of Combinatorial Theory Series A
Serial Year
1997
Journal title
Journal of Combinatorial Theory Series A
Record number
1530242
Link To Document