A spectral Erdos-Stone-Bollobas theorem
classification
🧮 math.CO
keywords
spectraltheorembounderdos-stoneerdos-stone-bollobasgivegraphimplying
read the original abstract
We give a bound on the spectral radius of a graph implying a quantitative version of the Erdos-Stone theorem.
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.