Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1017/S096354830800967X | Combinatorics, Probability & Computing |
Keywords | DocType | Volume |
monochromatic copy,n vertex,smallest integer n,3-uniform tight cycle,vertices v1,ramsey number,3-uniform tight hypergraph cycle,regularity lemma,blue colouring,3-uniform hypergraph | Journal | 18 |
Issue | ISSN | Citations |
1-2 | 0963-5483 | 9 |
PageRank | References | Authors |
0.63 | 12 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. E. Haxell | 1 | 212 | 26.40 |
| T. Łuczak | 2 | 124 | 13.68 |
| Yuejian Peng | 3 | 112 | 14.82 |
| V. Rödl | 4 | 750 | 131.81 |
| Andrzej Ruciński | 5 | 420 | 51.89 |
| Jozef Skokan | 6 | 251 | 26.55 |