A spectral Erdos-Stone-Bollobas theorem

2007/07/16 by Vladimir Nikiforov, Nikiforov, Vladimir · 3 citations
Mathematics · Computer Science · #Graph theory and applications #Limits and Structures in Graph Theory #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.0707.2259

Abstract

We give a bound on the spectral radius of a graph implying a quantitative version of the Erdos-Stone theorem.

Cited by

• Localization of spectral Turán-type theorems
• More on Nosal's spectral theorem: Books and 4-cycles
• Some Turán-type results for signless Laplacian spectral radius

Related

• A (forgotten) upper bound for the spectral radius of a graph
• An Erdős-Stone type result for high-order spectra of graphs
• The high order spectral radius of graphs without long cycles or paths
• The Moore bound for Spectral Radius
• Walks and the spectral radius of graphs