Stability for large forbidden subgraphs

DOI10.1002/JGT.20399MaRDI QIDQ3652562zbMATH OpenOpenAlexFDO

Authors Vladimir Nikiforov

Publication date 18 December 2009

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

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

zbMATH Keywords

\(r\)-partite subgraphforbidden subgraphspectral radiusstability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

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

Recommendations

• Exact stability for Turán's theorem
• Spectral saturation: inverting the spectral Turán theorem
• Turán's theorem inverted
• A spectral Erdős-Stone-Bollobás theorem
• Making K_r+1-free graphs r-partite

Cites work

• Complete \(r\)-partite subgraphs of dense \(r\)-graphs
• Graphs with many r -cliques have large complete r -partite subgraphs
• Graphs with many copies of a given subgraph

Cited in

(32)

• Spectral saturation: inverting the spectral Turán theorem
• Turán's theorem inverted
• Spectral extremal graphs for intersecting cliques
• On a conjecture of spectral extremal problems
• Spectral extremal graphs for disjoint cliques
• Degree powers in graphs: the Erdős-Stone theorem
• A spectral Erdős-Stone-Bollobás theorem
• An extension of Turán's theorem, uniqueness and stability
• Stability of the potential function
• Local Density in Graphs with Forbidden Subgraphs
• Exact stability for Turán's theorem
• Making K_r+1-free graphs r-partite
• Strong Turán stability
• Large joints in graphs
• Spectral extremal problem on disjoint color-critical graphs
• Spectral extremal graphs for edge blow-up of star forests
• Spectral extremal problem on t copies of -cycles
• A spectral stability result regarding the complete bipartite graph \(K_{2,t}\)
• On Turán-type problems and the abstract chromatic number
• Non-r-partite graphs without complete split subgraphs
• Spectral extremal results on edge blow-up of graphs
• A spectral generalized Alon-Frankl theorem
• A tensor's spectral bound on the clique number
• A spectral version of the theorem of Zykov and Erdős
• A spectral Erdős-Faudree-Rousseau theorem
• The exact Turán number of disjoint graphs -- a generalization of Simonovits' theorem, and beyond
• A spectral generalized Erdős-Gallai theorem
• Spectral supersaturation: triangles and bowties
• Decomposition family and spectral extremal problems on non-bipartite graphs
• Spectral skeletons and applications
• Non-bipartite graphs without theta subgraphs
• Some Turán-type results for the signless Laplacian spectral radius

This page was built for publication: Stability for large forbidden subgraphs

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