Disproof of a conjecture of Erdős and Simonovits on the Turán number of graphs with minimum degree 3
arXiv:2109.06110
Abstract
In 1981, Erdős and Simonovits conjectured that for any bipartite graph we have if and only if is -degenerate. Later, Erdős offered 250 dollars for a proof and 500 dollars for a counterexample. In this paper, we disprove the conjecture by finding, for any , a -regular bipartite graph with .
arXiv comment12 pages; v2 contains additional references