Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2022_07_25_wigderson: The two-edge star and two-edge matching, both bipartite, have joint extremal number 1 while each alone has linear extremal number; an unpublished elementary note with no outside acceptance documented.
2026_08_01_openai: A finite family of connected bipartite graphs, each containing a cycle, with ex(n, F) = O(n^(4/3 - 1/48)) and ex(n, G) = Omega(n^(4/3)), G in F; the disproof the site accepted on 31 August 2026, with no refereed version.
Linked from (1)
Graph