1 paper
Vishal Balaji, Powers Lamb, Andrew Lott +4
For integers k,r≥2, the diagonal Ramsey number Rr(k) is the minimum N∈N such that every r-coloring of the edges of a complete graph on N vertices yields o…