Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_09_15_gus: A Lean proof submitted to Conjectures.io under the name gus: for every delta and large n, some n planar points have (1 - delta) n or more distinct distance counts, so the answer is yes; site-certified, kernel-checked by that site.
Linked from (1)
Graph