A New Upper Bound On The Turan Number Of Even Cycles

In this paper, we prove ex(n, C-2k) <= (16 root 5 root k log k+o(1)).n(1+1/k). This improves on a result of Bukh and Jiang from 2017, thereby reducing the best known upper bound by a factor of root 5 log k.