Article ID Journal Published Year Pages File Type
5777607 Journal of Combinatorial Theory, Series B 2017 38 Pages PDF
Abstract
We determine the maximum number of induced cycles that can be contained in a graph on n≥n0 vertices, and show that there is a unique graph that achieves this maximum. This answers a question of Chvátal and Tuza from the 1980s. We also determine the maximum number of odd or even induced cycles that can be contained in a graph on n≥n0 vertices and characterise the extremal graphs. This resolves a conjecture of Chvátal and Tuza from 1988.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,