Ramsey-type numbers involving graphs and hypergraphs with large girth

A question of Erd\H{o}s asks if for every pair of positive integers $r$ and $k$, there exists a graph $H$ having $\textrm{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\'nski. 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 $\textrm{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.

[1]  P. Erdos.  Problems and results in combinatorial number theory , 1973 .

[2]  Vojtech Rödl,et al.  On ramsey families of sets , 1990, Graphs Comb..

[3]  Miklós Simonovits,et al.  Compactness results in extremal graph theory , 1982, Comb..

[4]  D. Saxton,et al.  Hypergraph containers , 2012, 1204.6595.

[5]  Vojtech Rödl,et al.  Sparse ramsey graphs , 1984, Comb..

[6]  J. Folkman.  Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring , 1970 .

[7]  Thomas F. Bloom,et al.  A quantitative improvement for Roth's theorem on arithmetic progressions , 2014, J. Lond. Math. Soc..

[8]  W. T. Gowers,et al.  RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) , 2001 .

[9]  Angelika Steger,et al.  A Short Proof of the Random Ramsey Theorem , 2014, Combinatorics, Probability and Computing.

[10]  C. T. Benson.  Minimal Regular Graphs of Girths Eight and Twelve , 1966, Canadian Journal of Mathematics.

[11]  P. E. -. R. L. Graham,et al.  ON PARTITION THEOREMS FOR FINITE GRAPHS , 1973 .

[12]  M. Simonovits,et al.  Cycles of even length in graphs , 1974 .

[13]  Vojtech Rödl,et al.  Ramsey Properties of Random Graphs and Folkman Numbers , 2017, Discuss. Math. Graph Theory.

[14]  P. Erdös,et al.  Ramsey Numbers for Cycles in Graphs , 1973 .

[15]  Joel H. Spencer.  Restricted Ramsey Configurations , 1975, J. Comb. Theory, Ser. A.

[16]  Alexandr V. Kostochka,et al.  On independent sets in hypergraphs , 2011, Random Struct. Algorithms.

[17]  V. Rödl,et al.  Threshold functions for Ramsey properties , 1995 .

[18]  Jaroslav Nešetřil,et al.  Simple proof of the existence of restricted ramsey graphs by means of a partite construction , 1981, Comb..

[19]  V. Rödl,et al.  The Ramsey property for graphs with forbidden complete subgraphs , 1976 .

[20]  T. Sanders.  On Roth's theorem on progressions , 2010, 1011.0104.

[21]  Jaroslav Nesetril,et al.  Large minimal sets which force long arithmetic progressions , 1986, J. Comb. Theory, Ser. A.

[22]  R. Singleton.  On Minimal graphs of maximum even girth , 1966 .

[23]  P. Erdös.  ON SEQUENCES OF INTEGERS NO ONE OF WHICH DIVIDES THE PRODUCT OF TWO OTHERS AND ON SOME RELATED PROBLEMS , 2004 .