Counting connected graphs with large excess - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2020

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 the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations, we derive the complete asymptotic expansion.

Mots clés

Fichier principal
Vignette du fichier
final_147.pdf (340.98 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-02166341 , version 1 (26-06-2019)

Identifiants

Citer

Élie de Panafieu. Counting connected graphs with large excess. 28-th International Conference on Formal Power Series and Algebraic Combinatorics, Simon Fraser University, Jul 2016, Vancouver, Canada. ⟨10.46298/dmtcs.6368⟩. ⟨hal-02166341⟩
16 Consultations
351 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More