Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_01_07_ma_tang: A note posted on the site's thread determines f(n,1) = C(n,2) − ⌊n²/4⌋ and writes f(n,k), for each fixed k ≥ 2, as C(n,2) minus the Turán number of a finite family of graphs on k+2 vertices, which stays undetermined; unrefereed.
Linked from (1)
Graph