Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2020_07_07_bucic_sudakov: Theorem 1.3 of Bucić and Sudakov: an n-vertex graph in which every seven vertices span a triangle has a clique on n^{5/12-o(1)} vertices, so the first inequality of Problem 813 holds for every c_1 < 1/12; Combinatorica 2023.
Linked from (1)
Graph