Spectral saturation: inverting the spectral Turán theorem

zbMath1159.05031arXiv0711.3488MaRDI QIDQ1010943

Vladimir Nikiforov

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.3488

zbMATH Keywords

stability resultscomplete r-partite graphr-partite Turan graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (10)

Spectral extremal graphs for intersecting cliques ⋮ A unique characterization of spectral extrema for friendship graphs ⋮ A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs ⋮ Spectral extremal graphs for the bowtie ⋮ Extremal problems for the \(p\)-spectral radius of graphs ⋮ On a conjecture of spectral extremal problems ⋮ Spectral extremal problem on disjoint color-critical graphs ⋮ Counting substructures and eigenvalues. I: Triangles ⋮ The spectral radius of graphs with no odd wheels ⋮ On the eccentric distance sum of graphs

This page was built for publication: Spectral saturation: inverting the spectral Turán theorem