3-Uniform hypergraphs of bounded degree have linear Ramsey numbers

Simple item page
dc.creatorCooley, Oliver
dc.creatorFountoulakis, Nikolaos
dc.creatorKühn, Daniela
dc.creatorOsthus, Deryk
dc.date2006-08-17
dc.date.accessioned2026-07-07T07:21:53Z
dc.date.available2026-07-07T07:21:53Z
dc.descriptionChvá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.
dc.description19 pages, 1 figure, submitted to J. Comb. Theory Ser. B
dc.identifierhttps://arxiv.org/abs/math/0608442
dc.identifierhttp://arxiv.org/abs/math/0608442
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/115462
dc.subjectCombinatorics
dc.subject05D10
dc.title3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
dc.typetext

Files

Collections

arXiv