Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_07_16_price: A manuscript shared by Liam Price on 16 July 2026, its proof credited to GPT 5.6 Sol Pro, gives the eventual upper bound exp(n^((log 2 + eps)/log log n)) for both thresholds H(n) and K(n); a partial claim, not reviewed by anyone.
Linked from (1)
Graph