Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2015_05_18_lee: Lee's theorem (2015 preprint, Ann. of Math. 2017): every d-degenerate graph H has Ramsey number at most c(d)|V(H)|, with c(d) doubly exponential in d, settling the Burr–Erdős conjecture; refereed and credited by the curator.
Linked from (1)
Graph