If an n-vertex graph has at least 10q + binom(r+1,2) edges, where n-1 = 4q+r, then it contains two cycles of consecutive even lengths unless it is a chain of K5 blocks and one K_{r+1} block.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A note on two cycles of consecutive even lengths in graphs
If an n-vertex graph has at least 10q + binom(r+1,2) edges, where n-1 = 4q+r, then it contains two cycles of consecutive even lengths unless it is a chain of K5 blocks and one K_{r+1} block.