Steinberg's Conjecture is false
Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture.
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2016-04 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Cohen-Addad, Vincent Hebdige, Michael Kral, Daniel Li, Zhentao Salgado, Esteban |
| description | Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2077155879</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2077155879</sourcerecordid><originalsourceid>FETCH-proquest_journals_20771558793</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSQDy5JzcxLSi1KVy9WcM7Py0pNLiktSlXILFZIS8wpTuVhYAXTvFCam0HZzTXE2UO3oCi_sDS1uCQ-K7-0KA8oFW9kYG5uaGpqYW5pTJwqALN3LKA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2077155879</pqid></control><display><type>article</type><title>Steinberg's Conjecture is false</title><source>Free E- Journals</source><creator>Cohen-Addad, Vincent ; Hebdige, Michael ; Kral, Daniel ; Li, Zhentao ; Salgado, Esteban</creator><creatorcontrib>Cohen-Addad, Vincent ; Hebdige, Michael ; Kral, Daniel ; Li, Zhentao ; Salgado, Esteban</creatorcontrib><description>Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><ispartof>arXiv.org, 2016-04</ispartof><rights>2016. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</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>780,784</link.rule.ids></links><search><creatorcontrib>Cohen-Addad, Vincent</creatorcontrib><creatorcontrib>Hebdige, Michael</creatorcontrib><creatorcontrib>Kral, Daniel</creatorcontrib><creatorcontrib>Li, Zhentao</creatorcontrib><creatorcontrib>Salgado, Esteban</creatorcontrib><title>Steinberg's Conjecture is false</title><title>arXiv.org</title><description>Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture.</description><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSQDy5JzcxLSi1KVy9WcM7Py0pNLiktSlXILFZIS8wpTuVhYAXTvFCam0HZzTXE2UO3oCi_sDS1uCQ-K7-0KA8oFW9kYG5uaGpqYW5pTJwqALN3LKA</recordid><startdate>20160419</startdate><enddate>20160419</enddate><creator>Cohen-Addad, Vincent</creator><creator>Hebdige, Michael</creator><creator>Kral, Daniel</creator><creator>Li, Zhentao</creator><creator>Salgado, Esteban</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20160419</creationdate><title>Steinberg's Conjecture is false</title><author>Cohen-Addad, Vincent ; Hebdige, Michael ; Kral, Daniel ; Li, Zhentao ; Salgado, Esteban</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20771558793</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Cohen-Addad, Vincent</creatorcontrib><creatorcontrib>Hebdige, Michael</creatorcontrib><creatorcontrib>Kral, Daniel</creatorcontrib><creatorcontrib>Li, Zhentao</creatorcontrib><creatorcontrib>Salgado, Esteban</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cohen-Addad, Vincent</au><au>Hebdige, Michael</au><au>Kral, Daniel</au><au>Li, Zhentao</au><au>Salgado, Esteban</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Steinberg's Conjecture is false</atitle><jtitle>arXiv.org</jtitle><date>2016-04-19</date><risdate>2016</risdate><eissn>2331-8422</eissn><abstract>Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2016-04 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_proquest_journals_2077155879 |
| source | Free E- Journals |
| title | Steinberg's Conjecture is false |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T17%3A15%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Steinberg's%20Conjecture%20is%20false&rft.jtitle=arXiv.org&rft.au=Cohen-Addad,%20Vincent&rft.date=2016-04-19&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2077155879%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2077155879&rft_id=info:pmid/&rfr_iscdi=true |