{"title":"Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs","authors":"Anders Martinsson, Raphael Steiner","doi":"10.1016/j.jctb.2023.08.009","DOIUrl":null,"url":null,"abstract":"<div><p>Hadwiger's famous coloring conjecture states that every <em>t</em>-chromatic graph contains a <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>t</mi></mrow></msub></math></span>-minor. Holroyd<!--> <span>[11]</span> <!-->conjectured the following strengthening of Hadwiger's conjecture: If <em>G</em> is a <em>t</em>-chromatic graph and <span><math><mi>S</mi><mo>⊆</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> takes all colors in every <em>t</em>-coloring of <em>G</em>, then <em>G</em> contains a <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>t</mi></mrow></msub></math></span>-minor <em>rooted at S</em>.</p><p>We prove this conjecture in the first open case of <span><math><mi>t</mi><mo>=</mo><mn>4</mn></math></span>. Notably, our result also directly implies a stronger version of Hadwiger's conjecture for 5-chromatic graphs as follows:</p><p>Every 5-chromatic graph contains a <span><math><msub><mrow><mi>K</mi></mrow><mrow><mn>5</mn></mrow></msub></math></span>-minor with a singleton branch-set. In fact, in a 5-vertex-critical graph we may specify the singleton branch-set to be any vertex of the graph.</p></div>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2023-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0095895623000692","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
Hadwiger's famous coloring conjecture states that every t-chromatic graph contains a -minor. Holroyd [11] conjectured the following strengthening of Hadwiger's conjecture: If G is a t-chromatic graph and takes all colors in every t-coloring of G, then G contains a -minor rooted at S.
We prove this conjecture in the first open case of . Notably, our result also directly implies a stronger version of Hadwiger's conjecture for 5-chromatic graphs as follows:
Every 5-chromatic graph contains a -minor with a singleton branch-set. In fact, in a 5-vertex-critical graph we may specify the singleton branch-set to be any vertex of the graph.
期刊介绍:
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.