加载中…
Let be an -vertex graph with clique number , and let denote the sum of the squared positive adjacency eigenvalues. We prove that This strengthens Wilf’s classical spectral Turán theorem and resolves a conjecture of Elphick and Wocjan. Adopting the relaxation of our companion paper on the square-energy conjecture, we reduce the theorem to a Motzkin–Straus inequality for doubly nonnegative matrices, which we prove via a local inverse-probability estimate for the Caro–Wei greedy algorithm on the complement.

生成讲解博客的中文版本

生成AI智能校验的中文版本