Erdős Problem 77: the limit of R(k)^(1/k)Open Problem
The diagonal Ramsey number is the least such that every red/blue colouring of the edges of the complete graph contains a monochromatic copy of . Ramsey's theorem guarantees that is finite; the question of how fast it grows is one of the central problems of extremal and probabilistic combinatorics. Erdős asked repeatedly ([Er88], [Er93];…