Ramsey-type numbers involving graphs and hypergraphs with large girth

H. Hàn, T. Retter, V. Rödl +1

A question of Erdős asks if for every pair of positive integers $r$ and $k$, there exists a graph $H$ having $\text{girth}(H)=k$ and the property that every $r$-colouring of the…