Proceedings of the 28-th International Conference on Formal Power Series and Algebraic Combinatorics
4-8 Jul 2016 Vancouver, British Columbia (Canada)
Friday 8
Combinatorics
Julien Courtiel
› 15:00 - 15:30 (30min)
› Djavad Mowafaghian Cinema
Counting connected graphs with large excess
Élie De Panafieu  1  
1 : Bell Labs France, Nokia
Bell Labs France

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. 



  • Poster
Online user: 1