 |
Discrete Mathematics & Theoretical Computer Science |
6368
Élie De Panafieu - Counting connected graphs with large excess
dmtcs:6368 - Discrete Mathematics & Theoretical Computer Science, April 22, 2020, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) - https://doi.org/10.46298/dmtcs.6368Counting connected graphs with large excessArticle
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: HAL:hal-02166341v1
Volume: DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
Published on: April 22, 2020
Imported on: July 4, 2016
Keywords: Combinatorics,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Publications
IsRelatedTo
-
10.1016/j.ejc.2006.05.006 1
- math/0502579
- 10.48550/arxiv.math/0502579
-
10.48550/arxiv.math/0502579 1
- 10.1016/j.ejc.2006.05.006
- math/0502579
- 1 ScholeXplorer
References
Consultation statistics
This page has been seen 123 times.
This article's PDF has been downloaded 137 times.