An improved upper bound for Ramsey number \(R(3,3,3,3;2)\)

DOI10.1016/0012-365X(93)E0187-9zbMath0834.05040OpenAlexW2016086178MaRDI QIDQ1893181

Adolfo Sánchez-Flores

Publication date: 10 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0187-9

zbMATH Keywords

Ramsey numbermonochromatic triangle4-colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Related Items (3)

On the $n$-color Rado number for the equation $x_{1}+x_{2}+ \dots +x_{k}+c =x_{k+1}$ ⋮ An adaptive upper bound on the Ramsey numbers $R(3,\dots,3)$ ⋮ On Some Open Questions for Ramsey and Folkman Numbers

Cites Work

• Unnamed Item
• Notes on the Ramsey number N(3,3,3,3)
• The Ramsey number N(3,3,3,3;2)
• On the Ramsey numbers N(3,3,\dots ,3;2)
• On the maximal triangle-free edge-chromatic graphs in three colors
• Combinatorial Relations and Chromatic Graphs

This page was built for publication: An improved upper bound for Ramsey number \(R(3,3,3,3;2)\)