Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1996_10_01_alon: Alon's 1996 refereed theorem: a graph on n vertices with independence number below the floor of the square root of n has a set of that many vertices spanning an absolute constant times sqrt(n) log n edges; answers Problem 801.
Linked from (1)
Graph