{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:02:33Z","timestamp":1746331353361,"version":"3.40.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2022YFA1006400"],"award-info":[{"award-number":["2022YFA1006400"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12201400"],"award-info":[{"award-number":["12201400"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004921","name":"Shanghai Jiao Tong University","doi-asserted-by":"publisher","award":["Explore X project"],"award-info":[{"award-number":["Explore X project"]}],"id":[{"id":"10.13039\/501100004921","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s00373-025-02899-5","type":"journal-article","created":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T06:08:07Z","timestamp":1739858887000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Bound for Hadwiger\u2019s Conjecture"],"prefix":"10.1007","volume":"41","author":[{"given":"Yan","family":"Wang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,18]]},"reference":[{"key":"2899_CR1","doi-asserted-by":"crossref","unstructured":"Delcourt, M., Postle, L.: Reducing linear Hadwiger\u2019s conjecture to coloring small graphs. J. Am. Math. Soc. (2024). arXiv:2108.01633","DOI":"10.1090\/jams\/1047"},{"key":"2899_CR2","first-page":"133","volume":"88","author":"H Hadwiger","year":"1943","unstructured":"Hadwiger, H.: \u00dcber eine klassifikation der streckenkomplexe. Vierteljschr. Naturforsch. Ges. Z\u00fcrich 88, 133\u2013142 (1943)","journal-title":"Vierteljschr. Naturforsch. Ges. Z\u00fcrich"},{"issue":"1","key":"2899_CR3","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.jctb.2006.04.004","volume":"97","author":"K Kawarabayashi","year":"2007","unstructured":"Kawarabayashi, K.: On the connectivity of minimum and minimal counterexamples to Hadwiger\u2019s conjecture. J. Combin. Theory Ser. B 97(1), 144\u2013150 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"2899_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-006-0684-x","volume":"23","author":"K Kawarabayashi","year":"2007","unstructured":"Kawarabayashi, K., Mohar, B.: Some recent progress and applications in graph minor theory. Graphs Combin. 23(1), 1\u201346 (2007)","journal-title":"Graphs Combin."},{"key":"2899_CR5","first-page":"37","volume":"38","author":"AV Kostochka","year":"1982","unstructured":"Kostochka, A.V.: The minimum Hadwiger number for graphs with a given mean degree of vertices. Metody Diskret. Analiz. 38, 37\u201358 (1982)","journal-title":"Metody Diskret. Analiz."},{"issue":"4","key":"2899_CR6","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02579141","volume":"4","author":"AV Kostochka","year":"1984","unstructured":"Kostochka, A.V.: Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica 4(4), 307\u2013316 (1984)","journal-title":"Combinatorica"},{"key":"2899_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2023.109020","volume":"422","author":"S Norin","year":"2023","unstructured":"Norin, S., Postle, L., Song, Z.-X.: Breaking the degeneracy barrier for coloring graphs with no $$K_t$$ minor. Adv. Math. 422, 109020 (2023)","journal-title":"Adv. Math."},{"key":"2899_CR8","unstructured":"Postle, L.: An even better density increment theorem and its application to Hadwiger\u2019s conjecture. arXiv:2006.14945v3 (2020)"},{"key":"2899_CR9","unstructured":"Postle, L.: Further progress towards Hadwiger\u2019s conjecture. arXiv:2006.11798v3 (2020). https:\/\/arxiv.org\/pdf\/2006.11798v3.pdf"},{"issue":"2","key":"2899_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1006\/jctb.1998.1835","volume":"74","author":"B Reed","year":"1998","unstructured":"Reed, B., Seymour, P.: Fractional colouring and Hadwiger\u2019s conjecture. J. Combin. Theory Ser. B 74(2), 147\u2013152 (1998)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2899_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01202354","volume":"13","author":"N Robertson","year":"1993","unstructured":"Robertson, N., Seymour, P., Thomas, R.: Hadwiger\u2019s conjecture for $$K_6$$-free graphs. Combinatorica 13, 279\u2013361 (1993)","journal-title":"Combinatorica"},{"key":"2899_CR12","doi-asserted-by":"crossref","unstructured":"Seymour, P.: Hadwiger\u2019s conjecture. In: Open problems in mathematics, pages 417\u2013437. Springer, New York (2016)","DOI":"10.1007\/978-3-319-32162-2_13"},{"issue":"2","key":"2899_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1017\/S0305004100061521","volume":"95","author":"A Thomason","year":"1984","unstructured":"Thomason, A.: An extremal function for contractions of graphs. Math. Proc. Camb. Philos. Soc. 95(2), 261\u2013265 (1984)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"2899_CR14","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/BF01594196","volume":"114","author":"K Wagner","year":"1937","unstructured":"Wagner, K.: \u00dcber eine eigenschaft der ebenen komplexe. Math. Ann. 114, 570\u2013590 (1937)","journal-title":"Math. Ann."},{"key":"2899_CR15","first-page":"280","volume":"2","author":"K Wagner","year":"1937","unstructured":"Wagner, K.: \u00dcber eine erweiterung des satzes von Kuratowski. Deutsche Math. 2, 280\u2013285 (1937)","journal-title":"Deutsche Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02899-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02899-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02899-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:16:56Z","timestamp":1746253016000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02899-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,18]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2899"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02899-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,2,18]]},"assertion":[{"value":"26 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Statements and Declarations"}},{"value":"The author has no conflict of interest to declare that is relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"36"}}