Answers are grounded in this paper and cite their sources.
Let G be a simple graph of order n and let kᵣ denote the number of unlabeled copies of Kᵣ in G. Let s⁺ denote the sum of the squares of the positive adjacency eigenvalues of G. For every fixed integer r≥2, we prove that, as n → ∞ \[ √s^+>(1-1r)n kᵣ₊₁≥ (1{rʳ⁻¹}-o_r(1))nʳ⁻¹. \] The coefficient r⁻⁽ʳ⁻¹⁾ is asymptotically best possible; in particular, the triangle case gives k₃≥ n/2-o(n). The proof combines positive square energy stability, the clique removal lemma, and a sharp clique count around a maximum r-cut. The triangle case requires an additional block-matrix argument.
No takes yet. Share an insight, caveat, or question.
Jayarajan et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: