The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
Haxell, P., Łucak, T., Peng, Y., Rodl, V., Rucinski, A. & Skokan, J.
(2009).
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Combinatorics, Probability and Computing,
18(1-2), 165-203.
https://doi.org/10.1017/S096354830800967X
(2009).
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Combinatorics, Probability and Computing,
18(1-2), 165-203.
https://doi.org/10.1017/S096354830800967X
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 Rödl.