3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
Cooley, Oliver · Fountoulakis, Nikolaos · Kühn, Daniela · Osthus, Deryk
Original · EN
Chvátal, Rödl, Szemerédi and Trotter 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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.