Skip to content
Preprint

Counting shorter even cycles in graphs forbidding an even cycle

Nov 2026 · 0 citations · 9 references
Mathematics

Abstract

For graphs $H$ and $F$, the generalized Tur\'an number $\operatorname{ex}(n,H,F)$ is the maximum number of copies of $H$ in an $n$-vertex $F$-free graph. Let $C_m$ be a cycle on $m$ vertices. Liu and Wu (2026) proved that, for fixed integers $k>\ell\ge 2$, $\operatorname{ex}(n,C_{2\ell},C_{2k})=\left(\frac{(k-1)_\ell}{2\ell}+o(1)\right)n^\ell$, where $(k-1)_\ell=(k-1)\cdots(k-\ell)$. In this paper, we determine the exact value of $\operatorname{ex}(n,C_{2\ell},C_{2k})$ for all sufficiently large $n$ and characterize the unique extremal graph.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.