Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2003_01_01_pantelidakis: Pantelidakis's Oxford DPhil thesis, as the site credits it: for odd n and m >= 3619 with n <= 2^m, there are at most as many groups of order n as of order 2^m.
Linked from (1)
Graph