Claims

../

2003_11_01_alon_krivelevich_sudakov: Corollary 2.3 of Alon, Krivelevich and Sudakov (Combin. Probab. Comput. 2003): ex(n,H) = O(n^(2-1/r)) when every vertex on one side of the bipartite H has degree at most r; refereed; the case of the problem that holds.

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), failing the conjectured O(n^(2-1/r)) at r = 2; credited by the site's curator, not refereed.

---