2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/115462Chvá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.19 pages, 1 figure, submitted to J. Comb. Theory Ser. BCombinatorics05D10text