Improved Bounds for Coloring Locally Sparse Hypergraphs

Abstract

We show that, for every k ? 2, every k-uniform hypergaph of degree ? and girth at least 5 is efficiently (1+o(1))(k-1) (? / ln ?)^{1/(k-1)}-list colorable. As an application we obtain the currently best deterministic algorithm for list-coloring random hypergraphs of bounded average degree