Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs

DOI10.1002/jgt.23036arXiv2205.00426OpenAlexW4387373135WikidataQ124810902 ScholiaQ124810902MaRDI QIDQ6143386

Jian Wang, Shipeng Wang, Weihua Yang

Publication date: 24 January 2024

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

Full work available at URL: https://arxiv.org/abs/2205.00426

zbMATH Keywords

stabilityTurán theoremGerbner's conjecturemaximal \(F\)-free

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• A stability theorem for maximal \(K_{r+1}\)-free graphs
• A note on stability for maximal \(F\)-free graphs
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• On maximal paths and circuits of graphs
• Strong Turán stability
• A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs

This page was built for publication: Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs