Résumé : We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only first term of the asymptotics and a bound on the error were known (Bender Canfield McKay 1995, Pittel Wormald 2005, van der Hofstad Spencer 2006). We present a proof based on analytic combinatorics, i.e. generating function manipulations, and derive the complete asymptotic expansion.
|Dernière modification : Wednesday 12 October 2022||Contact pour cette page : Cyril.Banderier at lipn.univ-paris13.fr|