Eigenvalues and forbidden subgraphs I

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2006-08-14
dc.date2006-10-02
dc.date.accessioned2026-07-07T07:21:44Z
dc.date.available2026-07-07T07:21:44Z
dc.descriptionWe present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.
dc.descriptionSome calculation errors in the first version are corrected
dc.identifierhttps://arxiv.org/abs/math/0608329
dc.identifierhttp://arxiv.org/abs/math/0608329
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/115406
dc.subjectCombinatorics
dc.subjectCommutative Algebra
dc.subject05C50
dc.titleEigenvalues and forbidden subgraphs I
dc.typetext

Files

Collections

arXiv