Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2005_03_01_alon_rodl: Theorem 3.2 of Alon and Rödl (Combinatorica 2005) gives the Ramsey number of k triangles against K_m up to polylogarithmic factors; its cases k = 2 and k = 1 make R(3,3,n) over R(3,n) grow like n over a power of log n.
Linked from (1)
Graph