Stability for large forbidden subgraphs

2007/07/17 by Vladimir Nikiforov, Nikiforov, Vladimir · 9 citations
Computer Science · Mathematics · #05C35 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #math.CO #msc:05C35

paper · pdf · doi:10.48550/arxiv.0707.2563

Some polishing. Updated references

openalex publication_date 2007/07/17 · arxiv created 2007/11/22 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We extend the classical stability theorem of Erdos and Simonovits for forbidden graphs of logarithmic order.

Cited by

• Spectral supersaturation for color-critical graphs
• Tensor Spectral Stability for Uniform Hypergraphs with Bounded Matching Number
• Edge-spectral Turán theorems for color-critical graphs with applications
• An edge-spectral Erdős-Stone-Simonovits theorem and its stability
• Non-bipartite graphs without theta subgraphs
• Non-r-partite graphs without complete split subgraphs
• Spectral Turán-type problem in non-r-partite graphs: Forbidden generalized book graph B_r,k
• Some Turán-type results for signless Laplacian spectral radius
• Ordinary and spectral extremal problems on vertex disjoint copies of even fans

Related

• A spectral stability theorem for large forbidden graphs
• The number of graphs with large forbidden subgraphs
• An Analytic Approach to Stability
• A stability theorem for multi-partite graphs
• Extremal problems in ordered graphs