Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_07_27_wouter_cvb: A three-page web write-up of 27 July 2026 sketches blow-ups of the butterfly graph with every triangle's degree sum at most 1.463878 n, so that the conjectured lower bound (2(√3 − 1) − o(1)) n fails; unreviewed.
Linked from (1)
Graph