Ramsey number $R(3,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_{3}$ in the first color or a monochromatic $K_{15}$ in the second color.

Updates

• 2013 Upper bound: $87$
  J. Goedgebeur and S.P. Radziszowski, New Computational Upper Bounds for Ramsey Numbers R(3, k), Electronic Journal of Combinatorics, http://www.combinatorics.org, #P30, 20(1) (2013), 28 pages.
  [via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06]
• 2016 Lower bound: $74$
  M. Kolodyazhny, graphs available at http://aluarium.net/forum/wiki-article-17.html, personal communication (2016).
  [via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06]