Counting connected graphs with large excess
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.
| Subject : | : | Talk |
| Topics | : | Combinatorics |
| PDF version | : |  PDF version |
- Poster
