Linear Ramsey Numbers for Bounded-Degree Hypergrahps

DOI10.1016/j.endm.2007.07.009zbMath1341.05155arXivmath/0612601OpenAlexW2147098658MaRDI QIDQ3503451

Yoshiyasu 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

hypergraphregularity lemmaRamsey theoryquasirandomness

Mathematics Subject Classification ID

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

Related Items (7)

Monochromatic loose-cycle partitions in hypergraphs ⋮ 3-uniform hypergraphs of bounded degree have linear Ramsey numbers ⋮ Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs ⋮ Ramsey numbers of sparse hypergraphs ⋮ The Ramsey number of Fano plane versus tight path ⋮ Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles ⋮ On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs

Cites Work

• The Ramsey number of a graph with bounded maximum degree
• On Ramsey numbers of uniform hypergraphs with given maximum degree
• On the Ramsey number of sparse 3-graphs
• Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem
• On the Erdös-Stone Theorem
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Unnamed Item
• Unnamed Item

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