2006/12/13 by Cooley, Oliver, Fountoulakis, Nikolaos, Kühn, Daniela +1
#05D10 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.math/0612351
Chvatal, Roedl, Szemeredi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In previous work, we proved the same result for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs, for any integer k > 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of bounded maximum degree into suitable k-uniform `quasi-random' hypergraphs.