Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2022_08_04_kwan_sah_sauermann_sawhney: Theorem 1.1 of Kwan, Sah, Sauermann and Sawhney (2022): a C-Ramsey graph on n vertices has induced subgraphs of every edge count up to (1 − η)e(G), giving the Erdős–McKay conjecture of Problem 88; refereed, PROVED on the site.
Linked from (1)
Graph