Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2025_09_13_cambie: Shows that f(u) attains each trivial bound, u + 2 and u squared, infinitely often while f(n) = (1 + o(1))n for almost all n; the site marks the problem solved on these observations, proved in Lean outside this corpus.
Linked from (1)
Graph