Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1981_03_01_ajtai_komlos_szemeredi: Theorem 2 of Ajtai, Komlós and Szemerédi (Combinatorica 1981) gives a path of length c(β)n almost surely in the uniform random graph with βn edges, β above one half; accepted on the refereed publication and the site's credit.
Linked from (1)
Graph