Coloring Simple Hypergraphs

Alan Frieze, Dhruv Mubayi

Fix an integer $k\ge 3$. A $k$-uniform hypergraph is simple if every two edges share at most one vertex. We prove that there is a constant $c$ depending only on $k$ such that ever…