Hadwiger meets Cayley
We show that every connected $k$-chromatic graph contains at least $k^{k-2}$ spanning trees.
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| 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 | Cooper, Jacob W Kabela, Adam Král', Daniel Pierron, Théo |
| description | We show that every connected $k$-chromatic graph contains at least $k^{k-2}$
spanning trees. |
| doi_str_mv | 10.48550/arxiv.2005.05989 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2005_05989</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2005_05989</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-c2d5b31fc59ada176976d15b85fc897acfdbe8af6abd74c0cc5cf151da9b98aa3</originalsourceid><addsrcrecordid>eNotzj0LgkAYwPFbGsIaG5ryC2h36nMvY0hlILS4y3NvISjEGZXfPrKm__bnR8iW0bSQAHSP4d0904xSSCkoqZZkU6F9dTcX4sG5xxiXOPVuWpGFx350638j0pyOTVkl9fV8KQ91glyoxGQWdM68AYUWmeBKcMtAS_BGKoHGW-0keo7aisJQY8B4Bsyi0koi5hHZ_bazq72HbsAwtV9fO_vyDwqMNVc</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Hadwiger meets Cayley</title><source>arXiv.org</source><creator>Cooper, Jacob W ; Kabela, Adam ; Král', Daniel ; Pierron, Théo</creator><creatorcontrib>Cooper, Jacob W ; Kabela, Adam ; Král', Daniel ; Pierron, Théo</creatorcontrib><description>We show that every connected $k$-chromatic graph contains at least $k^{k-2}$
spanning trees.</description><identifier>DOI: 10.48550/arxiv.2005.05989</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2020-05</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/2005.05989$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2005.05989$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Cooper, Jacob W</creatorcontrib><creatorcontrib>Kabela, Adam</creatorcontrib><creatorcontrib>Král', Daniel</creatorcontrib><creatorcontrib>Pierron, Théo</creatorcontrib><title>Hadwiger meets Cayley</title><description>We show that every connected $k$-chromatic graph contains at least $k^{k-2}$
spanning trees.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzj0LgkAYwPFbGsIaG5ryC2h36nMvY0hlILS4y3NvISjEGZXfPrKm__bnR8iW0bSQAHSP4d0904xSSCkoqZZkU6F9dTcX4sG5xxiXOPVuWpGFx350638j0pyOTVkl9fV8KQ91glyoxGQWdM68AYUWmeBKcMtAS_BGKoHGW-0keo7aisJQY8B4Bsyi0koi5hHZ_bazq72HbsAwtV9fO_vyDwqMNVc</recordid><startdate>20200512</startdate><enddate>20200512</enddate><creator>Cooper, Jacob W</creator><creator>Kabela, Adam</creator><creator>Král', Daniel</creator><creator>Pierron, Théo</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20200512</creationdate><title>Hadwiger meets Cayley</title><author>Cooper, Jacob W ; Kabela, Adam ; Král', Daniel ; Pierron, Théo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-c2d5b31fc59ada176976d15b85fc897acfdbe8af6abd74c0cc5cf151da9b98aa3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Cooper, Jacob W</creatorcontrib><creatorcontrib>Kabela, Adam</creatorcontrib><creatorcontrib>Král', Daniel</creatorcontrib><creatorcontrib>Pierron, Théo</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cooper, Jacob W</au><au>Kabela, Adam</au><au>Král', Daniel</au><au>Pierron, Théo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Hadwiger meets Cayley</atitle><date>2020-05-12</date><risdate>2020</risdate><abstract>We show that every connected $k$-chromatic graph contains at least $k^{k-2}$
spanning trees.</abstract><doi>10.48550/arxiv.2005.05989</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2005.05989 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2005_05989 |
| source | arXiv.org |
| subjects | Mathematics - Combinatorics |
| title | Hadwiger meets Cayley |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-18T18%3A17%3A15IST&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=Hadwiger%20meets%20Cayley&rft.au=Cooper,%20Jacob%20W&rft.date=2020-05-12&rft_id=info:doi/10.48550/arxiv.2005.05989&rft_dat=%3Carxiv_GOX%3E2005_05989%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 |