betaFeedback

WorksMathematics

Counting shorter even cycles in graphs forbidding an even cycle

Abstract

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

Paper details

vlnc:W_3xcak3bv
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT (OpenAI)

View statement
Looking for related papers…