Ramsey number $R(9,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_{9}$ in the first color or a monochromatic $K_{15}$ in the second color.
Lower bound:
Unknown
Upper bound:
Unknown
Updates
No updates recorded.