Ramsey number $R(6,13)$
The smallest number $n$ such that any two-coloring of the edges of the complete graph $K_n$ must contain either a monochromatic $K_{6}$ in the first color or a monochromatic $K_{13}$ in the second color.
Lower bound:
$347$
Upper bound:
$2499$
Updates
-
2007
Upper bound: $3703$
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] -
2016
Lower bound: $347$
E. Kuznetsov, Computational Lower Limits on Small Ramsey Numbers, preprint, arXiv, http://arxiv.org/abs/1505.07186 (2016).
[via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06] -
2020
Upper bound: $2499$
V. Angeltveit and B.D. McKay, personal communication (2019-2024).
[via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06]