The Rank-Ramsey problem
Anurag Bishnoi
The Ramsey number is the smallest such that every graph on vertices either contains a clique of size or an independent set of size . Ramsey’s theorem implies that these numbers always exist, and determining them (precisely or asymptotically) has been a major challenge in mathematics for the...