Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
1988_03_01_kostochka_pyber: Kostochka and Pyber (Combinatorica 1988) prove that a graph with n vertices and at least 4 to the t squared times n to the 1 + epsilon edges contains a subdivided K_t on at most 7 t squared log t over epsilon vertices.
Linked from (1)
Graph