Coloring uniform hypergraphs with small edge degrees

Abstract

Let k be a positive integer and n = [log2 k] We prove that there is an ε = ε(k) > 0 such that for sufficiently large r, every r-uniform hypergraph with maximum edge degree at most ε(k)k r(r/In r)n/n+1 is k-colorable.