Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Claims

../

2021_09_13_janzer: Janzer constructs, for every positive eta, a finite 3-regular bipartite graph H with Turán number O(n^(4/3+eta)); H is not 2-degenerate, so the Erdős–Simonovits equivalence of Problem 113 is false.

2026_08_01_openai: Theorem 1.2 of Chapter 10 of OpenAI's 2026 report gives a connected bipartite 2-degenerate graph H with ex(n,H) at least c n^(3/2+epsilon), so the forward implication of Problem 113 fails and the equivalence is false.