Even cycles in graphs avoiding longer even cycles

Abstract

A conjecture of Verstra\"ete states that for any fixed $\ell < k$ there exists a positive constant $c$ such that any $C_{2k}$-free graph $G$ contains a $C_{2\ell}$-free subgraph with at least $c |E(G)|$ edges. For $\ell = 2$, this conjecture was verified by K\"uhn and Osthus. We show that $C_6$ and $C_{2k}$ satisfy the conjecture for all odd $k$, but observe that a recent construction of a dense $C_{10}$-free subgraph of the hypercube yields a counterexample to the conjecture for $C_8$ and $C_{10}$.