Sharp logarithmic exponents for off-diagonal Ramsey numbers
What the paper claims, in its own words
For every fixed integer s ≥ 5, proves as , determining the logarithmic exponent and matching the classical upper bound at that scale. Here is the least number of vertices forcing an s-clique or a t-vertex independent set.
The plain-language explainer for this entry is still coming.