arXiv Analytics

Sign in

arXiv:2109.06110 [math.CO]AbstractReferencesReviewsResources

Disproof of a conjecture of Erdős and Simonovits on the Turán number of graphs with minimum degree 3

Oliver Janzer

Published 2021-09-13Version 1

In 1981, Erd\H{o}s and Simonovits conjectured that for any bipartite graph $H$ we have $\mathrm{ex}(n,H)=O(n^{3/2})$ if and only if $H$ is $2$-degenerate. Later, Erd\H{o}s offered 250 dollars for a proof and 100 dollars for a counterexample. In this paper, we disprove the conjecture by finding, for any $\varepsilon>0$, a $3$-regular bipartite graph $H$ with $\mathrm{ex}(n,H)=O(n^{4/3+\varepsilon})$.

Comments: 12 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:math/0009230 [math.CO] (Published 2000-09-26)
The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m
arXiv:math/0508537 [math.CO] (Published 2005-08-26)
On a conjecture of Widom
arXiv:math/0610977 [math.CO] (Published 2006-10-31)
New results related to a conjecture of Manickam and Singhi