Library Header Image
LSE Research Online LSE Library Services

The Ramsey number for hypergraph cycles II

Haxell, Penny, Luczak, Tomasz, Peng, Yuejian, Rodl, V, Rucinski, Andrzej and Skokan, Jozef (2007) The Ramsey number for hypergraph cycles II. . London School of Economics and Political Science, London, UK.

Full text not available from this repository.


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 coloring 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.

Item Type: Monograph (Report)
Official URL:
Additional Information: © 2007 London school of economics and political science
Divisions: Mathematics
Subjects: H Social Sciences > H Social Sciences (General)
Date Deposited: 11 Jul 2008 11:44
Last Modified: 21 Aug 2021 23:06

Actions (login required)

View Item View Item