Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1996_09_01_alon: Alon proves that for every large even n and e = n^2/2, every graph with e edges has a bipartite subgraph with at least e/2 + sqrt(e/8) + c e^(1/4) edges, so the correction f(m) of Problem 127 tends to infinity along m = n^2/2.
Linked from (1)
Graph