Date of Original Version

3-6-2014

Type

Working Paper

Abstract or Description

We show that, for each fixed k, an n-vertex graph not containing a cycle of length 2k has at most 80√ k log k · n 1+1/k + O(n) edges.

Creative Commons


This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 4.0 License.

Included in

Mathematics Commons

Share

COinS