WorksMathematics
Counting shorter even cycles in graphs forbidding an even cycle
Abstract
For graphs and , the generalized Turán number is the maximum number of copies of in an -vertex -free graph. Let be a cycle on vertices. Liu and Wu (2026) proved that, for fixed integers , , where . In this paper, we determine the exact value of for all sufficiently large and characterize the unique extremal graph.