Counting connected graphs with large excess

Élie de Panafieu

doi:10.46298/dmtcs.6368

Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2020

Counting connected graphs with large excess

(1)

Élie de Panafieu

Function : Author

Nokia Bell Labs [Nozay]

Abstract

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.

Keywords

Combinatorics

Domains

Combinatorics [math.CO]

Fichier principal

final_147.pdf (340.98 Ko)

CCSD Sciencesconf.org : Connect in order to contact the contributor

https://hal.science/hal-02166341

Submitted on : Wednesday, June 26, 2019-5:00:01 PM

Last modification on : Wednesday, April 24, 2024-4:59:31 PM

Dates and versions

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

Identifiers

HAL Id : hal-02166341 , version 1
DOI : 10.46298/dmtcs.6368

Cite

É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⟩

Counting connected graphs with large excess

Abstract

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Altmetric

Share