Ramsey number $R(3,3)$
Cmglee, via Wikimedia Commons. CC BY-SA 4.0.
The smallest number $n$ such that any two-coloring of the edges of the complete graph $K_n$ must contain either a monochromatic $K_{3}$ in the first color or a monochromatic $K_{3}$ in the second color.
Value: $6$
Updates
-
Lower bound: $6$
Trivial or easy according to the secondary source.
[via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06] -
Upper bound: $6$
Trivial or easy according to the secondary source.
[via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06]