A spectral stability theorem for large forbidden graphs

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2007-11-22
dc.date.accessioned2026-07-07T08:44:29Z
dc.date.available2026-07-07T08:44:29Z
dc.descriptionWe extend the classical stability theorem of Erdos and Simonovits in two directions: first, we allow the order of the forbidden graph to grow as log of order of the host graph, and second, our extremal condition is on the spectral radius of the host graph.
dc.identifierhttps://arxiv.org/abs/0711.3485
dc.identifierhttp://arxiv.org/abs/0711.3485
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142674
dc.subjectCombinatorics
dc.subject05C35,05C50
dc.titleA spectral stability theorem for large forbidden graphs
dc.typetext

Files

Collections

arXiv