![]() |
Discrete Mathematics & Theoretical Computer Science |
We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations, we derive the complete asymptotic expansion.
Source : ScholeXplorer
IsRelatedTo ARXIV math/0502579 Source : ScholeXplorer IsRelatedTo DOI 10.1016/j.ejc.2006.05.006 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.math/0502579
|