Name
Abstract | ||
|---|---|---|
Let Cn denote the 3-uniform hypergraph loose cycle, that is the hypergraph with vertices v1.....,vn and edges v1v2v3, v3v4v5, v5v6v7,.....,vn-1vnv1. We prove that every red-blue colouring of the edges of the complete 3-uniform hypergraph with N vertices contains a monochromatic copy of Cn, where N is asymptotically equal to 5n/4. Moreover this result is (asymptotically) best possible. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.jcta.2005.02.005 | J. Comb. Theory, Ser. A |
Keywords | Field | DocType |
monochromatic copy,red-blue colouring,vertices v1,hypergraph cycle,ramsey number,regularity lemma,hypergraph,n vertex,3-uniform hypergraph loose cycle,colouring,cn denote,cycle,3-uniform hypergraph | Discrete mathematics,Monochromatic color,Combinatorics,Vertex (geometry),Hypergraph,Ramsey's theorem,Mathematics | Journal |
Volume | Issue | ISSN |
113 | 1 | Journal of Combinatorial Theory, Series A |
Citations | PageRank | References |
27 | 2.99 | 9 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. E. Haxell | 1 | 212 | 26.40 |
| T. Łuczak | 2 | 124 | 13.68 |
| Y. Peng | 3 | 35 | 4.58 |
| V. Rödl | 4 | 750 | 131.81 |
| A. Ruciński | 5 | 50 | 13.29 |
| M. Simonovits | 6 | 223 | 113.06 |
| Jozef Skokan | 7 | 251 | 26.55 |