Answers are grounded in this paper and cite their sources.
For graphs H and F, the generalized Turán number ex(n,H,F) is the maximum number of copies of H in an n-vertex F-free graph. Let Cₘ be a cycle on m vertices. Liu and Wu (2026) proved that, for fixed integers k>≥ 2, ex(n,C₂,C₂ₖ)=((k-1)_/2+o(1))n^, where (k-1)₌(k-1)⋯(k-). In this paper, we determine the exact value of ex(n,C₂,C₂ₖ) for all sufficiently large n and characterize the unique extremal graph.
No takes yet. Share an insight, caveat, or question.
Han et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: