{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:28Z","timestamp":1753893868445,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>It was conjectured by Ohba and confirmed\u00a0 by Noel, Reed and Wu that, for any graph $G$, if $|V(G)|\\le 2\\chi(G)+1$ then\u00a0 $G$ is chromatic-choosable; i.e., it satisfies $\\chi_l(G)=\\chi(G)$. This indicates that the graphs with high chromatic number are chromatic-choosable. We observe that this is also the case for uniform hypergraphs and further propose a generalized version of Ohba's conjecture: for any $r$-uniform hypergraph $H$ with $r\\geq 2$, if $|V(H)|\\le r\\chi(H)+r-1$ then\u00a0 $\\chi_l(H)=\\chi(H)$. We show that the condition of the proposed conjecture is sharp by giving two classes of $r$-uniform hypergraphs $H$ with $|V(H)|= r\\chi(H)+r$ and $\\chi_l(H)&gt;\\chi(H)$. To support the conjecture, we\u00a0 prove that $\\chi_l(H)=\\chi(H)$ for two classes of\u00a0 $r$-uniform hypergraphs $H$ with $|V(H)|= r\\chi(H)+r-1$.<\/jats:p>","DOI":"10.37236\/8070","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T07:10:15Z","timestamp":1578640215000},"source":"Crossref","is-referenced-by-count":0,"title":["Chromatic-Choosability of Hypergraphs with High Chromatic Number"],"prefix":"10.37236","volume":"26","author":[{"given":"Wei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianguo","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2019,1,4]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i1p5\/7764","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i1p5\/7764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:19:11Z","timestamp":1579234751000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v26i1p5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,4]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,1,11]]}},"URL":"https:\/\/doi.org\/10.37236\/8070","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2019,1,4]]},"article-number":"P1.5"}}