Geodesic
Counting connected graphs with large excess
Discrete mathematics & theoretical computer science, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016), DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) (2020).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2020_special_379_a50,
     author = {De Panafieu, \'Elie},
     title = {Counting connected graphs with large excess},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)},
     year = {2020},
     doi = {10.46298/dmtcs.6368},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6368/}
}
TY  - JOUR
AU  - De Panafieu, Élie
TI  - Counting connected graphs with large excess
JO  - Discrete mathematics & theoretical computer science
PY  - 2020
VL  - DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6368/
DO  - 10.46298/dmtcs.6368
LA  - en
ID  - DMTCS_2020_special_379_a50
ER  - 
%0 Journal Article
%A De Panafieu, Élie
%T Counting connected graphs with large excess
%J Discrete mathematics & theoretical computer science
%D 2020
%V DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6368/
%R 10.46298/dmtcs.6368
%G en
%F DMTCS_2020_special_379_a50
De Panafieu, Élie. Counting connected graphs with large excess. Discrete mathematics & theoretical computer science, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016), DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) (2020). doi : 10.46298/dmtcs.6368. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6368/

Cité par Sources :