Year: 2006
Type: preprint
Abstract: We 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.
Source: arXiv (Cornell University)
Author: Ishigami, Yoshiyasu
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2953125489