All Random Solved Random Open
OPEN - $250
Give an asymptotic formula for $R(3,k)$.
It is known that there exists some constant $c>0$ such that for large $k$ \[c\frac{k^2}{\log k}\leq R(3,k) \leq (1+o(1))\frac{k^2}{\log k}.\] The lower bound is due to Kim [Ki95], the upper bound is due to Shearer [Sh83], improving an earlier bound of Ajtai, Komlós, and Szemerédi [AjKoSz80]. The lower bound has been improved to \[\left(\frac{1}{4}-o(1)\right)\frac{k^2}{\log k}\] independently by Bohman and Keevash [BoKe21] and Pontiveros, Griffiths and Morris [PGM20]. The latter collection of authors conjecture that this lower bound is the true order of magnitude.

See also [544].