If an n-vertex C_{2k+1}-free graph has at least floor((n-r+1)^2/4) + C(r,2) edges, then every odd cycle in it has length at most r, and the bound is sharp.
Andr´ asfai, P
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
-
Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs
If an n-vertex C_{2k+1}-free graph has at least floor((n-r+1)^2/4) + C(r,2) edges, then every odd cycle in it has length at most r, and the bound is sharp.