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

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\mathrm{/}k}+O(n)$ edges.