file.pdf (178.44 kB)
Download fileA bound on the number of edges in graphs without an even cycle
journal contribution
posted on 2014-03-06, 00:00 authored by Boris Bukh, Zilin JiangWe 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.