A spectral Erdos-Stone-Bollobas theorem

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2007-07-16
dc.date2007-11-22
dc.date.accessioned2026-07-07T08:44:09Z
dc.date.available2026-07-07T08:44:09Z
dc.descriptionWe give a bound on the spectral radius of a graph implying a quantitative version of the Erdos-Stone theorem.
dc.descriptionSome polishing. Updated refrences
dc.identifierhttps://arxiv.org/abs/0707.2259
dc.identifierhttp://arxiv.org/abs/0707.2259
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142556
dc.subjectCombinatorics
dc.subject05C50; 05C35
dc.titleA spectral Erdos-Stone-Bollobas theorem
dc.typetext

Files

Collections

arXiv