Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2021_04_30_conlon_fox_pham: Theorem 1.1 of the 2021 preprint: for every r at least 2, an r-Ramsey complete sequence with O(r log² n) terms up to n, and none with c r log² n terms up to every large n; an unrefereed preprint the site's curator credits.
Linked from (1)
Graph