A note on stability for maximal \(F\)-free graphs

DOI10.1007/s00373-021-02372-zzbMath1479.05155arXiv2101.03223OpenAlexW3200823881MaRDI QIDQ2053718

Dániel Gerbner

Publication date: 30 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

stabilitycolor-criticalTurán theory

Mathematics Subject Classification ID

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

Related Items

A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs, Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stability theorem for maximal \(K_{r+1}\)-free graphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Degrees and matchings
• Stability results for graphs with a critical edge
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Large generalized books are \(p\)-good
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• Intersection theorems for systems of sets
• On a valence problem in extremal graph theory
• On a problem of K. Zarankiewicz
• On the structure of linear graphs
• Strong Turán stability
• Many \(T\) copies in \(H\)-free graphs