The Ramsey Number for 3-Uniform Tight Hypergraph Cycles

Let C(3)n denote the 3-uniform tight cycle, that is, the hypergraph with vertices v1,.–.–., vn and edges v1v2v3, v2v3v4,.–.–., vn−1vnv1, vnv1v2. We prove that the smallest integer N = N(n) for which every red–blue colouring of the edges of the complete 3-uniform hypergraph with N vertices contains a monochromatic copy of C(3)n is asymptotically equal to 4n/3 if n is divisible by 3, and 2n otherwise. The proof uses the regularity lemma for hypergraphs of Frankl and Rodl.

[1]  Alan D. Sokal,et al.  On Dependency Graphs and the Lattice Gas , 2006, Combinatorics, Probability and Computing.

[2]  Daniela Kühn,et al.  3-Uniform hypergraphs of bounded degree have linear Ramsey numbers , 2008, J. Comb. Theory, Ser. B.

[3]  Tomasz Luczak,et al.  R(Cn, Cn, Cn)<=(4+o(1)) n , 1999, J. Comb. Theory, Ser. B.

[4]  David Conlon,et al.  Ramsey numbers of sparse hypergraphs , 2007, Random Struct. Algorithms.

[5]  Vojtech Rödl,et al.  On the Ramsey Number of Sparse 3-Graphs , 2008, Graphs Comb..

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

[7]  Endre Szemerédi,et al.  The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs , 2008, Electron. J. Comb..

[8]  Vojtech Rödl,et al.  A Dirac-Type Theorem for 3-Uniform Hypergraphs , 2006, Combinatorics, Probability and Computing.

[9]  V. RÖDL,et al.  THE RAMSEY NUMBER FOR HYPERGRAPH CYCLES II , 2007 .

[10]  Vojtech Rödl,et al.  Short paths in quasi-random triple systems with sparse underlying graphs , 2006, J. Comb. Theory, Ser. B.

[11]  Tomasz Luczak,et al.  The Ramsey number for a triple of long even cycles , 2007, J. Comb. Theory, Ser. B.

[12]  Vojtech Rödl,et al.  The Ramsey number for hypergraph cycles I , 2006, J. Comb. Theory, Ser. A.

[13]  Richard H. Schelp,et al.  All Ramsey numbers for cycles in graphs , 1974, Discret. Math..

[14]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[15]  V. Rosta.  On a ramsey-type problem of J. A. Bondy and P. Erdös. I , 1973 .

[16]  Vojtech Rödl,et al.  Extremal problems on set systems , 2002, Random Struct. Algorithms.

[17]  V. Rödl,et al.  Extremal problems on set systems , 2002 .

[18]  Daniela Kühn,et al.  Embeddings and Ramsey numbers of sparse κ-uniform hypergraphs , 2006, Comb..

[19]  Endre Szemerédi,et al.  Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs , 2010, J. Graph Theory.

[20]  Endre Szemerédi,et al.  Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs , 2010, Graphs Comb..

[21]  S. Radziszowski.  Small Ramsey Numbers , 2011 .