Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2017_12_15_kwan_sudakov: Theorem 1.1 of Kwan and Sudakov (Trans. Amer. Math. Soc. 2019): a graph with no clique or independent set of C log n vertices has at least order n^{5/2} induced subgraphs pairwise differing in vertex or edge count; refereed.
Linked from (1)
Graph