Counting connected graphs with large excess
proceedings of the 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) 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 co...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | de Panafieu, Elie |
| description | proceedings of the 28th International Conference on Formal Power
Series and Algebraic Combinatorics (FPSAC 2016) 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. |
| doi_str_mv | 10.48550/arxiv.1604.07307 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1604_07307</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1604_07307</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-4994879de6feff2f45df23ba2502b393ba65ed4b0f03f35a0495e23968dbb2783</originalsourceid><addsrcrecordid>eNotzj1vwjAUhWEvDBXwAzrhHSVc_BmPKIJSKRILe2TH1yEShMhJS_j3bUOn805HDyHvW0hFJiVsbByb73SrQKSgOeg3ss7vX-3QtDWt7m2L1YCe1tF2l54-muFCrzbWSHGssO8XZBbstcfl_87J-bA_58ekOH185rsisUrrRBgjMm08qoAhsCCkD4w7yyQwx81vKYleOAjAA5cWhJHIuFGZd47pjM_J6nU7acsuNjcbn-WfupzU_AfjKTwy</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Counting connected graphs with large excess</title><source>arXiv.org</source><creator>de Panafieu, Elie</creator><creatorcontrib>de Panafieu, Elie</creatorcontrib><description>proceedings of the 28th International Conference on Formal Power
Series and Algebraic Combinatorics (FPSAC 2016) 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.</description><identifier>DOI: 10.48550/arxiv.1604.07307</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2016-04</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1604.07307$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1604.07307$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>de Panafieu, Elie</creatorcontrib><title>Counting connected graphs with large excess</title><description>proceedings of the 28th International Conference on Formal Power
Series and Algebraic Combinatorics (FPSAC 2016) 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.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzj1vwjAUhWEvDBXwAzrhHSVc_BmPKIJSKRILe2TH1yEShMhJS_j3bUOn805HDyHvW0hFJiVsbByb73SrQKSgOeg3ss7vX-3QtDWt7m2L1YCe1tF2l54-muFCrzbWSHGssO8XZBbstcfl_87J-bA_58ekOH185rsisUrrRBgjMm08qoAhsCCkD4w7yyQwx81vKYleOAjAA5cWhJHIuFGZd47pjM_J6nU7acsuNjcbn-WfupzU_AfjKTwy</recordid><startdate>20160425</startdate><enddate>20160425</enddate><creator>de Panafieu, Elie</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20160425</creationdate><title>Counting connected graphs with large excess</title><author>de Panafieu, Elie</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-4994879de6feff2f45df23ba2502b393ba65ed4b0f03f35a0495e23968dbb2783</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>de Panafieu, Elie</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>de Panafieu, Elie</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Counting connected graphs with large excess</atitle><date>2016-04-25</date><risdate>2016</risdate><abstract>proceedings of the 28th International Conference on Formal Power
Series and Algebraic Combinatorics (FPSAC 2016) 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.</abstract><doi>10.48550/arxiv.1604.07307</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1604.07307 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1604_07307 |
| source | arXiv.org |
| subjects | Mathematics - Combinatorics |
| title | Counting connected graphs with large excess |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T05%3A16%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Counting%20connected%20graphs%20with%20large%20excess&rft.au=de%20Panafieu,%20Elie&rft.date=2016-04-25&rft_id=info:doi/10.48550/arxiv.1604.07307&rft_dat=%3Carxiv_GOX%3E1604_07307%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |