Name
Abstract | ||
|---|---|---|
Chvatal, Rodl, Szemeredi and Trotter [V. Chvatal, V. Rodl, E. Szemeredi, W.T. Trotter Jr., The Ramsey number of a graph with a bounded maximum degree, J. Combin. Theory Ser. B 34 (1983) 239-243] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. We prove that the same holds for 3-uniform hypergraphs. The main new tool which we prove and use is an embedding lemma for 3-uniform hypergraphs of bounded maximum degree into suitable 3-uniform 'pseudo-random' hypergraphs. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.jctb.2007.08.008 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
v. chvatal,embedding problems,ramsey numbers,j. combin,v. rodl,hypergraphs,bounded maximum degree,ramsey number,suitable 3-uniform,regularity lemma,e. szemeredi,3-uniform hypergraphs,theory ser,bounded degree,linear ramsey number,trotter jr.,maximum degree | Ramsey theory,Graph,Discrete mathematics,Combinatorics,Embedding,Constraint graph,Ramsey's theorem,Degree (graph theory),Mathematics,Lemma (mathematics),Bounded function | Journal |
Volume | Issue | ISSN |
98 | 3 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
12 | 0.79 | 14 |
Authors | ||
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 |