Ramsey number $R(8,11)$

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

Updates

• Lower bound: $457$
  Trivial or easy according to the secondary source.
  [via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06]
• 2007 Upper bound: $10630$ (10,630)
  Huang Yi Ru, Wang Yuandi, Sheng Wancheng, Yang Jiansheng, Zhang Ke Min and Huang Jian, New Upper Bound Formulas with Parameters for Ramsey Numbers, Discrete Mathematics, 307 (2007) 760-763.
  [via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06]
• 2020 Upper bound: $7040$
  V. Angeltveit and B.D. McKay, personal communication (2019-2024).
  [via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06]