Linear Ramsey numbers for bounded-degree hypergraphs

Simple item page
dc.creatorIshigami, Yoshiyasu
dc.date2006-12-20
dc.date2007-12-13
dc.date.accessioned2026-07-07T08:48:55Z
dc.date.available2026-07-07T08:48:55Z
dc.descriptionWe show that the Ramsey number is linear for every uniform hypergraph with bounded-degree. This is a hypergraph extension of the famous theorem for ordinary graphs which Chvátal et al. showed in 1983. Our proof is simple, contains the multicolor case, and provides a strong embedding lemma. It shows the potential of a new hypergraph regularity lemma by the author.
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/math/0612601
dc.identifierhttp://arxiv.org/abs/math/0612601
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144117
dc.subjectCombinatorics
dc.subjectProbability
dc.subject05D55,05C65
dc.titleLinear Ramsey numbers for bounded-degree hypergraphs
dc.typetext

Files

Collections

arXiv