Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1988_01_01_gyori: Győri (Colloq. Math. Soc. János Bolyai 52, 1988) proves that a graph on n vertices with t_2(n) + k edges, k = o(n^2), has at least k - O(k^2/n^2) edge-disjoint triangles, giving f(c) for all c; accepted on curator credit.
Linked from (1)
Graph