{"title":"Counting connected graphs with large excess","authors":"Élie de Panafieu","doi":"10.46298/dmtcs.6368","DOIUrl":null,"url":null,"abstract":"International audience\n \n 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.\n","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Theoretical Computer Science","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.46298/dmtcs.6368","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
International audience
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.
期刊介绍：
DMTCS is a open access scientic journal that is online since 1998. We are member of the Free Journal Network.
Sections of DMTCS
Analysis of Algorithms
Automata, Logic and Semantics
Combinatorics
Discrete Algorithms
Distributed Computing and Networking
Graph Theory.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
