Improved Inapproximability of Rainbow Coloring

A rainbow q-coloring of a k-uniform hypergraph is a qcoloring of the vertex set such that every hyperedge contains all q colors. We prove that given a rainbow (k − 2b√kc)-colorable k-uniform hyperg ...