Ramsey number $R(3,10)$

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_{10}$ in the second color.

Updates

• 1989 Lower bound: $40$
  G. Exoo, On Two Classical Ramsey Numbers of the Form R(3, n), SIAM Journal on Discrete Mathematics, 2 (1989) 488-490.
  [via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06]
• 2024 Upper bound: $41$
  V. Angeltveit, R(3, 10) ≤ 41, manuscript (2024).
  [via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06]