Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_07_06_lee_pohoata_zhu: Claims a planar set of n points in which every subset of at least n^{1-delta} points contains an isosceles triangle, so that P_2(n)<n^{1-c} for some c>0; an arXiv preprint.
Linked from (1)
Graph