New proofs of stability theorems on spectral graph problems
From MaRDI portal
Abstract: Both the Simonovits stability theorem and the Nikiforov spectral stability theorem are powerful tools for solving exact values of Tur'{a}n numbers in extremal graph theory. Recently, F"{u}redi [J. Combin. Theory Ser. B 115 (2015)] provided a concise and contemporary proof of the Simonovits stability theorem. In this note, we present a unified treatment for some extremal graph problems, including short proofs of Nikiforov's spectral stability theorem and the clique stability theorem proved recently by Ma and Qiu [European J. Combin. 84 (2020)]. Moreover, some spectral extremal problems related to the -spectral radius and signless Laplacian radius are also included.
This page was built for publication: New proofs of stability theorems on spectral graph problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6392969)
