Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1982_12_01_rodl: Rödl's graphs of chromatic number above 3, every m-vertex subgraph bipartite after deleting at most epsilon m edges, refute every linear edge budget, for r >= 3 with a clique joined; refereed and credited by the site's curator.
Linked from (1)
Graph