Ramsey number $R(3,9)$

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_{9}$ in the second color.

Updates

• 1966-01 Lower bound: $36$
  J.G. Kalbfleisch, Chromatic Graphs and Ramsey's Theorem, Ph.D. thesis, University of Waterloo, January 1966.
  [via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06]
• 1982 Upper bound: $36$
  C. Grinstead and S. Roberts, On the Ramsey Numbers R(3, 8) and R(3, 9), Journal of Combinatorial Theory, Series B, 33 (1982) 27-51.
  [via Small Ramsey Numbers, Stanisław Radziszowski, 2024-09-06]