Coloring sparse hypergraphs

Jeff Cooper, Dhruv Mubayi

Fix $k\ge 3$, and let $G$ be a $k$-uniform hypergraph with maximum degree $\Delta$. Suppose that for each $l=2,...,k-1$, every set of l vertices of G is in at most $Δ^{(k-l)/(k-1)…