Ramsey number $R(5,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_{5}$ in the first color or a monochromatic $K_{11}$ in the second color.
Lower bound:
$183$
Upper bound:
$511$
Verified bounds
Verified bounds come with a certificate that is checked automatically: a formal proof in Lean, or an explicit construction checked by a program. Submit a certificate.
- Lower bound: None yet
- Upper bound: None yet
Updates from the literature
-
2007
Upper bound: $633$
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, revision #18, 2026-04-24] -
2016
Lower bound: $183$
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, revision #18, 2026-04-24] -
2020
Upper bound: $511$
V. Angeltveit and B.D. McKay, personal communication (2019-2024).
[via Small Ramsey Numbers, Stanisław Radziszowski, revision #18, 2026-04-24]