Embeddings and Ramsey numbers of sparse k-uniform hypergraphs

Simple item page
dc.creatorCooley, Oliver
dc.creatorFountoulakis, Nikolaos
dc.creatorKühn, Daniela
dc.creatorOsthus, Deryk
dc.date2006-12-13
dc.date2008-06-19
dc.date.accessioned2026-07-07T09:45:25Z
dc.date.available2026-07-07T09:45:25Z
dc.descriptionChvatal, 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.
dc.description24 pages, 2 figures. To appear in Combinatorica
dc.identifierhttps://arxiv.org/abs/math/0612351
dc.identifierhttp://arxiv.org/abs/math/0612351
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/163189
dc.subjectCombinatorics
dc.subject05D10
dc.titleEmbeddings and Ramsey numbers of sparse k-uniform hypergraphs
dc.typetext

Files

Collections

arXiv