Counting shorter even cycles in graphs forbidding an even cycle

For graphs $H$ and $F$, the generalized Turán 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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24238
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Counting shorter even cycles in graphs forbidding an even cycle

Zhuoran Han, Yaojun Chen
arXiv (Cornell University)
Limits and Structures in Graph Theory
preprint

Counting shorter even cycles in graphs forbidding an even cycle

Zhuoran Han, Yaojun Chen
preprint en

Abstract

For graphs $H$ and $F$, the generalized Turán 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.

arXiv (Cornell University)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon