Dense uniform hypergraphs have high list chromatic number

Noga Alon, Alexandr Kostochka*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)2119-2125
Number of pages7
JournalDiscrete Mathematics
Issue number14
StatePublished - 28 Jul 2012


FundersFunder number
Oswald Veblen Fund
USA-Israeli BSF
National Science FoundationDMS-0965587, 09-01-00244
Seventh Framework Programme226718
European Research Council
Russian Foundation for Basic Research


    • Co-degree
    • Hypergraph
    • List coloring


    Dive into the research topics of 'Dense uniform hypergraphs have high list chromatic number'. Together they form a unique fingerprint.

    Cite this