{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:57Z","timestamp":1753893837240,"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>Let $H$ be a hypergraph and let $L_v : v \\in V(H)$ be sets; we refer to these sets as lists and their elements as colors. A list coloring of $H$ is an assignment of a color from $L_v$ to each $v \\in V(H)$ in such a way that every edge of $H$ contains a pair of vertices of different colors. The hypergraph $H$ is $k$-list-colorable if it has a list coloring from any collection of lists of size $k$. The list chromatic number of $H$ is the minimum $k$ such that $H$ is $k$-list-colorable. In this paper we prove that every $d$-regular three-uniform linear hypergraph has list chromatic number at least $(\\frac{\\log d}{5\\log \\log d})^{1\/2}$ provided $d$ is large enough. On the other hand there exist $d$-regular three-uniform linear hypergraphs with list chromatic number at most $\\log_3 d+3$. This leaves the question open as to the existence of such hypergraphs with list chromatic number $o(\\log d)$ as $d \\rightarrow \\infty$.<\/jats:p>","DOI":"10.37236\/401","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:09:47Z","timestamp":1578697787000},"source":"Crossref","is-referenced-by-count":10,"title":["List Coloring Hypergraphs"],"prefix":"10.37236","volume":"17","author":[{"given":"Penny","family":"Haxell","sequence":"first","affiliation":[]},{"given":"Jacques","family":"Verstraete","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2010,9,22]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1r129\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v17i1r129\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T18:23:19Z","timestamp":1579285399000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v17i1r129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,22]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2010,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/401","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2010,9,22]]},"article-number":"R129"}}