Linear Ramsey Numbers for Bounded-Degree Hypergrahps

DOI10.1016/J.ENDM.2007.07.009MaRDI QIDQ3503451zbMATH OpenOpenAlexFDO

Authors Yoshiyas Ishigami

Publication date 5 June 2008

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0612601

zbMATH Keywords

hypergraphquasirandomnessRamsey theoryregularity lemma

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Hypergraphs (05C65) Ramsey theory (05D10)

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'atal 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.

Recommendations

• 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
• On Ramsey numbers of uniform hypergraphs with given maximum degree
• Ramsey numbers of sparse hypergraphs
• Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
• On the Ramsey number of sparse 3-graphs

Cites work

• scientific article; zbMATH DE number 3494449 (Why is no real title available?)
• scientific article; zbMATH DE number 2086426 (Why is no real title available?)
• On Ramsey numbers of uniform hypergraphs with given maximum degree
• On the Erdös-Stone Theorem
• On the Ramsey number of sparse 3-graphs
• Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
• Regular Partitions of Hypergraphs: Regularity Lemmas
• The Ramsey number of a graph with bounded maximum degree

Cited in

(13)

• Fraternal augmentations, arrangeability and linear Ramsey numbers
• Linear upper bounds for local Ramsey numbers
• The Ramsey number of Fano plane versus tight path
• Linearity of saturation for Berge hypergraphs
• 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
• scientific article; zbMATH DE number 4202198 (Why is no real title available?)
• Monochromatic loose-cycle partitions in hypergraphs
• scientific article; zbMATH DE number 6813638 (Why is no real title available?)
• On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
• Partitioning edge-colored hypergraphs into few monochromatic tight cycles
• Ramsey numbers of sparse hypergraphs
• On ordered Ramsey numbers of tripartite 3-uniform hypergraphs
• Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs

This page was built for publication: Linear Ramsey Numbers for Bounded-Degree Hypergrahps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503451)