arXiv:1605.08597 Abstract | arXiv Analytics

arXiv:1605.08597 [math.CO]Abstract References Reviews Resources

Analytic combinatorics of connected graphs

Published 2016-05-27Version 1

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

Comments: 25 pages + 6 pages of appendix, 8 figures, long version of the talk arXiv:1604.07307 accepted at FPSAC 2016

Categories: math.CO, cs.DM

Keywords: analytic combinatorics, connected graphs, complete asymptotic expansion, first term, linear number

Related articles: Most relevant | Search more

arXiv:2205.06487 [math.CO] (Published 2022-05-13)

Asymptotics for connected graphs and irreducible tournaments

Thierry Monteil, Khaydar Nurligareev

arXiv:2301.08707 [math.CO] (Published 2023-01-20)

Separating the edges of a graph by a linear number of paths

Marthe Bonamy, Fábio Botler, François Dross, Tássio Naia, Jozef Skokan

arXiv:1711.09422 [math.CO] (Published 2017-11-26)

The effect of local majority on global majority in connected graphs