Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_09_23_openai: For every fixed epsilon, all but o(n) points of an n-point planar set see at least n^(1-epsilon) distinct distances, so some point sees n^(1-o(1)) of them: the first question answered yes; accepted on built Lean as a partial claim.
Linked from (1)
Graph