High girth hypergraphs with unavoidable monochromatic or rainbow edges

Maria Axenovich, Annette Karrer

A classical result of Erdős and Hajnal claims that for any integers $k,r,g\ge 2$ there is an $r$-uniform hypergraph of girth at least $g$ with chromatic number at least $k$. Th…