Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2025_03_03_draganic_keevash_muyesser: Every (n+1)-regular graph on 2n vertices has at least c 2^(2n) vertex subsets spanned by a cycle, and at least (1/2 - o(1)) 2^(2n) of them; refereed in IMRN 2025 and credited by the site's curator.
Linked from (1)
Graph