Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1972_03_01_erdos: Erdős proves that every integer between an absolute constant times n^{3/2} and n choose 2, except two values, is the number of lines of some n points in the plane; refereed, and credited by the site.
1988_06_01_salamon_erdos: Salamon and Erdős determine, for every sufficiently large n, exactly which integers occur as the number of lines determined by n points in the plane, the corrected Statement of Problem 606 in full; refereed, and credited by the site as the solution.
Linked from (1)
Graph