A spectral stability theorem for large forbidden graphs
Combinatorics
2007-11-26 v1
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.
Cite
@article{arxiv.0711.3485,
title = {A spectral stability theorem for large forbidden graphs},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:0711.3485},
year = {2007}
}