h/t Benny Sudakov The Ramsey number R(ℓ,k) is the smallest integer n such that in any two-coloring of the edges of the complete graph on n vertices, , by red and blue, there is either a red (a complete graph … Continue reading →| Combinatorics and more