Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_06_18_van_doorn_tang: Van Doorn and Tang's Theorem 1.1 (arXiv, June 2026): n_k exceeds exp(log^2 k / (20 log log k)) for all large k, so n_k grows faster than every power of k, as Erdős expected; an unrefereed preprint.
Linked from (1)
Graph