Ramsey-type numbers involving graphs and hypergraphs with large girth

Erdős asked if, for every pair of positive integers g and k, there exists a graph H having girth (H) = k and the property that every r-colouring of the edges of H yields a monochromatic cycle Ck. The existence of such graphs H was confirmed by the third author and Ruciński.We consider the related numerical problem of estimating the order of the smallest graph H with this property for given integers r and k. We show that there exists a graph H on R10k2; k15k3 vertices (where R = R(Ck; r) is the r-colour Ramsey number for the cycle Ck) having girth (H) = k and the Ramsey property that every r-colouring of the edges of H yields a monochromatic Ck Two related numerical problems regarding arithmetic progressions in subsets of the integers and cliques in graphs are also considered.

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

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

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

[4]  Vojtech Rödl,et al.  An exponential-type upper bound for Folkman numbers , 2016, Comb..

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

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

[7]  J. Balogh,et al.  Independent sets in hypergraphs , 2012, 1204.6530.

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

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

[10]  Jozef Skokan,et al.  Exact Ramsey numbers of odd cycles via nonlinear optimisation , 2016, Advances in Mathematics.

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

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

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

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

[15]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

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

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

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

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

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

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

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