|
|
 |
|
Mardi 31 Mai
| Heure: |
14:00 - 17:00 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
Counting connected graphs with large excess |
| Description: |
Élie de Panafieu 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 Spencer2006). We present a proof based on analytic combinatorics, i.e. generating function manipulations, and derive the complete asymptotic expansion. |
|
|
