A spectral Erdos-Stone-Bollobas theorem
Combinatorics
2007-11-22 v3
Abstract
We give a bound on the spectral radius of a graph implying a quantitative version of the Erdos-Stone theorem.
Keywords
Cite
@article{arxiv.0707.2259,
title = {A spectral Erdos-Stone-Bollobas theorem},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:0707.2259},
year = {2007}
}
Comments
Some polishing. Updated refrences