Counting connected graphs with large excess

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.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete mathematics and theoretical computer science Jg. DMTCS Proceedings, 28th...
1. Verfasser:	De Panafieu, Élie
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	DMTCS 22.04.2020 Discrete Mathematics & Theoretical Computer Science
Schlagworte:	[math.math-co]mathematics [math]/combinatorics [math.co] Combinatorics Mathematics Combinatorics
ISSN:	1365-8050, 1462-7264, 1365-8050
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	1365-8050 1462-7264 1365-8050
DOI:	10.46298/dmtcs.6368