A spectral stability theorem for large forbidden graphs
classification
🧮 math.CO
keywords
graphforbiddenhostorderspectralstabilitytheoremallow
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.