Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)



A note on the Turán function of even cycles

Author: Oleg Pikhurko
Journal: Proc. Amer. Math. Soc. 140 (2012), 3687-3692
MSC (2010): Primary 05C35
Published electronically: March 1, 2012
MathSciNet review: 2944709
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: The Turán function $ \mathrm {ex}(n,F)$ is the maximum number of edges in an $ F$-free graph on $ n$ vertices. The question of estimating this function for $ F=C_{2k}$, the cycle of length $ 2k$, is one of the central open questions in this area that goes back to the 1930s. We prove that

$\displaystyle \mathrm {ex}(n,C_{2k})\le (k-1)\, n^{1+1/k}+16(k-1)n, $

improving the previously best known general upper bound of Verstraëte [Combin.Probab. Computing 9 (2000), 369-373] by a factor $ 8+o(1)$ when $ n\gg k$.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC (2010): 05C35

Retrieve articles in all journals with MSC (2010): 05C35

Additional Information

Oleg Pikhurko
Affiliation: Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, Pennsylvannia 15213

Received by editor(s): September 23, 2010
Received by editor(s) in revised form: April 20, 2011
Published electronically: March 1, 2012
Additional Notes: The author was partially supported by the National Science Foundation, Grant DMS-0758057.
Communicated by: Jim Haglund
Article copyright: © Copyright 2012 American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication.

American Mathematical Society