{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:32:59Z","timestamp":1760524379390,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In 2001, in a survey article about list coloring, Woodall conjectured that for every pair of integers $s,t \\ge 1$, all graphs without a $K_{s,t}$-minor are $(s+t-1)$-choosable.\r\nIn this note we refute this conjecture in a strong form: We prove that for every choice of constants $\\varepsilon&gt;0$ and $C \\ge 1$ there exists $N=N(\\varepsilon,C) \\in \\mathbb{N}$ such that for all integers $s,t $ with $N \\le s \\le t \\le Cs$ there exists a graph without a $K_{s,t}$-minor and list chromatic number greater than $(1-\\varepsilon)(2s+t)$.<\/jats:p>","DOI":"10.37236\/10994","type":"journal-article","created":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T08:36:35Z","timestamp":1656664595000},"source":"Crossref","is-referenced-by-count":2,"title":["Disproof of a Conjecture by Woodall on the Choosability of $K_{s,t}$-Minor-Free Graphs"],"prefix":"10.37236","volume":"29","author":[{"given":"Raphael","family":"Steiner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2022,7,1]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i3p2\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v29i3p2\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T08:36:36Z","timestamp":1656664596000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v29i3p2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,1]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,7,1]]}},"URL":"https:\/\/doi.org\/10.37236\/10994","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2022,7,1]]},"article-number":"P3.2"}}