Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1999_11_01_promel_rodl: Prömel and Rödl (J. Combin. Theory Ser. A 88 (1999)) prove that a graph on n vertices with no clique or independent set on c_1 log n vertices contains every graph on c_2 log n vertices induced, which answers Problem 1031.
Linked from (1)
Graph