A strong structural stability of C₂ k + 1-free graphs

DOI10.1002/JGT.70022MaRDI QIDQ7238183zbMATH OpenFDO

Authors Zilong Yan, Yuejian Peng

Publication date 5 May 2026

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/JGT.70022

zbMATH Keywords

cyclestabilityTurán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites work

• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• A stability result for $C_{2k+1}$-free graphs
• Eine Extremalaufgabe aus der Graphentheorie.
• Exact stability for Turán's theorem
• Extremal numbers for odd cycles
• How to make a graph bipartite
• scientific article; zbMATH DE number 3523543 (Why is no real title available?)
• scientific article; zbMATH DE number 3258858 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• scientific article; zbMATH DE number 3298603 (Why is no real title available?)
• Making K_r+1-free graphs r-partite
• Making a K₄-free graph bipartite
• On the structure of linear graphs
• Stability results for graphs with a critical edge

Cited in

(1)

• Number of copies of \(C_4\) guarantees strong structural stability of graphs forbidding \(C_{2k+1}\)

This page was built for publication: A strong structural stability of \(C_{2 k + 1}\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238183)