@article{e9162d1a965b498ca0376e7ee9118daf,

title = "Dense uniform hypergraphs have high list chromatic number",

abstract = "The first author showed that the list chromatic number of every graph with average degree d is at least (0.5-o(1))log2d. We prove that for r<3, every r-uniform hypergraph in which at least half of the (r-1)-vertex subsets are contained in at least d edges has list chromatic number at least lnd100r3. When r is fixed, this is sharp up to a constant factor.",

keywords = "Co-degree, Hypergraph, List coloring",

author = "Noga Alon and Alexandr Kostochka",

note = "Funding Information: The authors thank the referees for helpful comments and suggestions. The research of the first author was supported in part by an ERC advanced grant, by a USA-Israeli BSF grant, by the Oswald Veblen Fund and by the Bell Companies Fellowship. The research of the second author was supported in part as by NSF grant DMS-0965587 and by grant 09-01-00244 of the Russian Foundation for Basic Research.",

year = "2012",

month = jul,

day = "28",

doi = "10.1016/j.disc.2011.05.013",

language = "אנגלית",

volume = "312",

pages = "2119--2125",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "14",

}