Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1975_01_01_komlos_sulyok_szemeredi: Every set of N integers contains a Sidon subset of size at least c N^{1/2}, which with the trivial upper bound fixes the order of l(N) at N^{1/2}; the lower half of the order question, refereed and credited by the site.
Linked from (1)
Graph