On spectral Turán theorems: confirming a conjecture of Guiduli and two problems of Nikiforov

Abstract

Let $G$ be an $n$-vertex graph, and let $\hat{I}»(G)$ and $\hat{I}{»}_n(G)$ denote the largest and smallest eigenvalues of its adjacency matrix. Write $e(G)$ for the number of edges of $G$, $d(G)=2e(G)/n$ for its average degree, and $T_r(n)$ for the $r$-partite Turán graph on $n$ vertices. We prove four sharp results in spectral Turán theory. First, we confirm Guiduli's spectral dense-neighborhood conjecture (1996) in a stronger form: if $\hat{I}»(G)\ge \hat{I}»(T_r(n))$, then either $G\cong T_r(n)$, or there exists a vertex $v$ such that $\hat{I}»(G[N(v)])>\hat{I}»(T_{r-1}(d(v)))$. Moreover, when $\hat{I}»(G)>\hat{I}»(T_r(n))$, every vertex attaining the maximum entry in any nonnegative Perron eigenvector of $G$ has this property. Second, we answer a problem of Nikiforov (2009) by showing that the exact Turán edge threshold is detected by the exact spectral threshold: for every $r\ge 2$ and every $n$, $\hat{I}»(G)<\hat{I}»(T_r(n))$, implying $e(G)<e(T_r(n)).$ Our proof also determines the equality cases. Third, we answer another question of Nikiforov (2009) by showing that his least-eigenvalue clique bound \[ ω(G)\ge 1+\frac{2e(G)}{(n-d(G))(d(G)-λ_n(G))} \] does imply the concise form of Turán's theorem. Finally, we discuss an open problem proposed by Ai et al. (2026) in \cite{ALNS26+}.

20 pages