Counting connected graphs with large excess
classification
🧮 math.CO
keywords
connectedgraphsnumberanalyticasymptoticasymptoticscombinatoricscomplete
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.