Journée-séminaire de combinatoire

(équipe CALIN du LIPN, université Paris-Nord, Villetaneuse)

Le 31 mai 2016 à 14h00 en B107, Élie de Panafieu nous parlera de : Counting connected graphs with large excess

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.

 [arXiv]


Dernière modification : Wednesday 25 May 2016 Valid HTML 4.01! Valid CSS! Contact : Cyril.Banderier at lipn.univ-paris13.fr