An adaptive upper bound on the Ramsey numbers $R(3,\dots,3)$

zbMath1459.05199arXiv1912.05353MaRDI QIDQ5148735

Shalom Eliahou

Publication date: 5 February 2021

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

zbMATH Keywords

\(n\)-color Ramsey number

Mathematics Subject Classification ID

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

Related Items (2)

The Schur degree of additive sets ⋮ The pigeonhole principle and multicolor Ramsey numbers

Cites Work

• Small Ramsey numbers
• An improved upper bound for Ramsey number \(R(3,3,3,3;2)\)
• On a diagonal conjecture for classical Ramsey numbers
• Algebraic structure of chromatic graphs associated with the Ramsey number N(3,3,3; 2)
• On the Ramsey numbers N(3,3,\dots ,3;2)
• The Mathematical Coloring Book
• Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers
• A survey of bounds for classical Ramsey numbers
• On Some Open Questions for Ramsey and Folkman Numbers
• Combinatorial Relations and Chromatic Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: An adaptive upper bound on the Ramsey numbers $R(3,\dots,3)$