A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A Bound on the Number of Edges in Graphs Without an Even Cycle
2016
Combinatorics, probability & computing
Preserved Fulltext
Other Versions
We show that, for each fixed k, an n-vertex graph not containing a cycle of length 2k has at most $80\sqrt{k\log k}\cdot n^{1+1/k}+O(n)$ edges.
doi:10.1017/s0963548316000134
fatcat:a5qxxehfbndlvmakdht7nz76xi