The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices (Q1369735)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The asymptotic number of labeled graphs with n vertices, q edges, and no isolated vertices |
scientific article; zbMATH DE number 1076995
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices |
scientific article; zbMATH DE number 1076995 |
Statements
The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices (English)
0 references
23 February 1998
0 references
This paper provides an asymptotic formula for enumerating labeled graphs with the order and the size as two parameters. This formula is uniformly for the order and the size when the size is greater than a half order of the graph.
0 references
labeled graph
0 references
enumeration
0 references
asymptotic estimate
0 references
Euler-Maclaurin summation
0 references
0 references
0.865631639957428
0 references
0.8167533874511719
0 references
0.8113369941711426
0 references
0.806366503238678
0 references
