A spectral Erdos-Stone-Bollobas theorem

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Combinatorics, 05C50; 05C35

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/142556

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0707.2259
 http://arxiv.org/abs/0707.2259

Collections

arXiv