Ramsey number $R(10,15)$

The smallest number $n$ such that any two-coloring of the edges of the complete graph $K_n$ must contain either a monochromatic $K_{10}$ in the first color or a monochromatic $K_{15}$ in the second color.

Updates

• Lower bound: $1313$
  Trivial or easy according to the secondary source.
  [via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06]