Ramsey number $R(7,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_{7}$ in the first color or a monochromatic $K_{15}$ in the second color.
Lower bound:
Unknown
Upper bound:
$12635$
(12,635)
Updates
-
2007
Upper bound: $22112$
(22,112)
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: $12635$
(12,635)
V. Angeltveit and B.D. McKay, personal communication (2019-2024).
[via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06]