Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1991_09_01_alon: Proves that order n^{2/3} log n points of the n by n grid suffice for their lines to cover the grid, so t(n) = o(n); refereed in Geom. Funct. Anal. and credited by the site's curator.
Linked from (1)
Graph