file.pdf (178.44 kB)
0/0

A bound on the number of edges in graphs without an even cycle

Download (178.44 kB)
journal contribution
posted on 06.03.2014 by Boris Bukh, Zilin Jiang

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.

History

Date

06/03/2014

Exports

Exports