Three conjectures on the first two graph eigenvalues

Let \(λ_1(G)≥λ_2(G)\) be the two largest adjacency eigenvalues of a finite simple graph \(G\) on at least two vertices. We resolve the three conjectures appearing as 1.15--1.17 in Kannan, Kumar and Pragada. First, for every noncomplete graph, we prove \(λ_1(G)^2+λ_2(G)^2≤ 2∑e∈ E(G)(1-1/c(e))\), where \(c(e)\) is the largest order of a clique containing \(e\). Second, we construct connected \(K_5-e\)-free graphs of arbitrarily large size that violate the exact color-critical bound proposed by Li, Liu and Zhang. Third, for every fixed \(F\) with \(χ(F)=r+1≥3\), we prove, uniformly over \(F\)-free graphs with \(m=e(G)→∞\),\[λ_1(G)^2+λ_2(G)^2 ≤2(1-1r)m-r-2/rΔ(G)+o_F(m),\]where \(Δ(G)\) is the maximum degree. The coefficient of the degree term is best possible. The arguments use the half-plane complete-positivity theorem of Coutinho, Liu, Spier, Tang and Zhang, together with an explicit connected construction, weighted clique removal and spectral separation of vertices of high degree. The three main results are formalized in Lean 4.