Spectral saturation: inverting the spectral Turan theorem

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2007-11-22
dc.date.accessioned2026-07-07T08:44:30Z
dc.date.available2026-07-07T08:44:30Z
dc.descriptionWe prove that if the spectral radius of a graph G of order n is larger than the spectral radius of the r-partite Turan graph of the same order, then G contains various supergraphs of the complete graph of order r+1. In particular G contains a complete r-partite graph of size log n with one edge added to the first part. These results complete a project of Erdos from 1963. We also give corresponding stability results.
dc.identifierhttps://arxiv.org/abs/0711.3488
dc.identifierhttp://arxiv.org/abs/0711.3488
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142675
dc.subjectCombinatorics
dc.subject05C50,05C35
dc.titleSpectral saturation: inverting the spectral Turan theorem
dc.typetext

Files

Collections

arXiv