Elsevier

Discrete Mathematics

Volume 312, Issue 14, 28 July 2012, Pages 2119-2125
Discrete Mathematics

Dense uniform hypergraphs have high list chromatic number

https://doi.org/10.1016/j.disc.2011.05.013Get rights and content
Under an Elsevier user license
open archive

Abstract

The first author showed that the list chromatic number of every graph with average degree d is at least (0.5o(1))log2d. We prove that for r3, every r-uniform hypergraph in which at least half of the (r1)-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

List coloring
Hypergraph
Co-degree

Cited by (0)