Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_09_13_kruer_kohlmeyer_price: A manuscript with a Lean file constructing, for every large n, n points in strictly convex position each with at least (1/4 - o(1)) log log n others at distance one, so some convex polygon refutes the question; claimed.
Linked from (1)
Graph