On the Turán number for the hexagon (Q2497327): Difference between revisions

A well-known and long-standing conjecture of Erdős and Simonovits asserts that ex\((n,C_{2k})\), the maximum number of edges in a graph on \(n\) vertices, not containing a \(2k\)-cycle, is asymptotically \({1\over 2}n^{1+1/k}\), for any fixed \(k\), as \(n\rightarrow \infty\). This important paper provides a counterexample to this conjecture, by showing ex\((n,C_{6})\geq 0.5338 n^{4/3} \) for infinitely many values of \(n\). On the other hand, the paper also shows ex\((n,C_{6})\geq 0.6272 n^{4/3} \) for all sufficently large \(n\).