Name
Abstract | ||
|---|---|---|
Chvatal, Rodl, Szemer,di and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6,23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to kappa-uniform hypergraphs for any integer kappa a parts per thousand yen 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for kappa-uniform hypergraphs of bounded maximum degree into suitable kappa-uniform 'quasi-random' hypergraphs. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s00493-009-2356-y | COMBINATORICA |
Keywords | DocType | Volume |
ramsey numbers,embedding problems,hypergraphs,regularity lemma | Journal | 29.0 |
Issue | ISSN | Citations |
3.0 | 0209-9683 | 5 |
PageRank | References | Authors |
0.53 | 19 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oliver Cooley | 1 | 39 | 9.15 |
| Nikolaos Fountoulakis | 2 | 185 | 18.04 |
| Daniela Kühn | 3 | 463 | 42.11 |
| Deryk Osthus | 4 | 643 | 76.03 |