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

Updates

No updates recorded.