3-Uniform hypergraphs of bounded degree have linear Ramsey numbers

Authors:
Oliver Cooley;Nikolaos Fountoulakis;Daniela Kühn;Deryk Osthus
Affiliations:
School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK;School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK;School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK;School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK
Venue:
Journal of Combinatorial Theory Series B
Year:
2008

Citing 8
Cited 2

Extremal problems on set systems

Random Structures & Algorithms
Integer and fractional packings in dense 3-uniform hypergraphs

Random Structures & Algorithms
Regularity properties for triple systems

Random Structures & Algorithms
Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs

Combinatorics, Probability and Computing
The counting lemma for regular k-uniform hypergraphs

Random Structures & Algorithms
The Ramsey number for hypergraph cycles I

Journal of Combinatorial Theory Series A
On Ramsey numbers of uniform hypergraphs with given maximum degree

Journal of Combinatorial Theory Series A
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree

Journal of Combinatorial Theory Series B

The ramsey number for 3-uniform tight hypergraph cycles

Combinatorics, Probability and Computing
Ramsey numbers of 3-uniform loose paths and loose cycles

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

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.