Ramsey-type numbers involving graphs and hypergraphs with large girth

Abstract

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 edges of $H$ yields a monochromatic cycle $C_k$. The existence of such graphs was confirmed by the third author and Ruciński. We consider the related numerical problem of determining the smallest such graph with this property. We show that for integers $r$ and $k$, there exists a graph $H$ on $R^{10k^2}{k}^{15k^3}$ vertices (where $R=R(C_k;r)$ is the $r$-colour Ramsey number for the cycle $C_k$) having $\text{girth}(H)=k$ and the Ramsey property that every $r$-colouring of $E(H)$ yields a monochromatic $C_k$. Two related numerical problems regarding arithmetic progressions in sets and cliques in graphs are also considered.