New Upper Bound on Extremal Number of Even Cycles

Abstract

In this paper, we prove $\text{ex}(n,C_{2k})\le (16\sqrt{5}\sqrt{k\log k}+o(1))\cdot n^{1+1/k}$. We improved on Bukh--Jiang's method used in their 2017 publication, thereby reducing the best known upper bound by a factor of $\sqrt{5\log k}$.