A spectral stability theorem for large forbidden graphs
From MaRDI portal
Publication:6207571
arXiv0711.3485MaRDI QIDQ6207571FDOQ6207571
Authors: Vladimir Nikiforov 
Publication date: 21 November 2007
Abstract: We extend the classical stability theorem of Erdos and Simonovits in two directions: first, we allow the order of the forbidden graph to grow as log of order of the host graph, and second, our extremal condition is on the spectral radius of the host graph.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)
This page was built for publication: A spectral stability theorem for large forbidden graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6207571)
