The Ramsey number for hypergraph cycles. I. (Q817613): Difference between revisions

In a \(3\)-uniform hypergraph a loose cycle \({\mathcal C}_n\) is a graph with vertices \(\{v_1, v_2, \dots, v_n\}\) and hyperedges \(\{v_1v_2v_3, v_3v_4v_5, \dots, v_{n-1}v_nv_1\}\), and so \(n\) must be even. It is proved that in any two-coloring of the hyperedges of a complete \(3\)-uniform hypergraph with \(N\) vertices there is a monochromatic \({\mathcal C}_n\) if \(N\) is asymptotically equal to \(5n/4\). More specifically it is shown for any \(\varepsilon > 0\) and \(n\) sufficiently large that \( 5n/4 - 2 < r({\mathcal C}_n, {\mathcal C}_n) < 5(1 + \varepsilon)n/4. \) The proof is based on a form of the regularity lemma of Szemerédi. A forthcoming paper will deal with the Ramsey number for tight cycles, where consecutive edges on the cycle share two vertices.