Erdős Problem #113 — Bipartite graphs with an Turán bound
For a bipartite graph , is if and only if is -degenerate, meaning every nonempty subgraph of has a vertex of degree at most ?
References
Additional references
O. Janzer, Disproof of a conjecture of Erdős and Simonovits on the Turán number of graphs with minimum degree 3, Combinatorica 43 (2023), 105–130.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.