Minimum degree stability of C₂k+1-free graphs

DOI10.1002/JGT.23086MaRDI QIDQ6494007zbMATH OpenFDO

Authors Xiaoli Yuan, Yuejian Peng

Publication date 29 April 2024

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

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

zbMATH Keywords

minimum degreeodd cyclestability

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35)

Recommendations

• A stability result for $C_{2k+1}$-free graphs
• On the Structure of Graphs with Given Odd Girth and Large Minimum Degree
• On the structure of graphs with given odd girth and large minimum degree
• A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs
• Minimum degree stability of H-free graphs

Cited in

(6)

• A stability result for $C_{2k+1}$-free graphs
• An improved result on the stability of odd cycles
• Spectral extremal problems for non-bipartite graphs without odd cycles
• Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite
• Number of copies of \(C_4\) guarantees strong structural stability of graphs forbidding \(C_{2k+1}\)
• A tight minimum-degree condition guaranteeing that every \(\{C_5,C_7,C_9,C_{11}\}\)-free graph is 3-colorable

This page was built for publication: Minimum degree stability of \({C}_{2k+1}\)-free graphs

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