{"id":"c7deae3c-caa9-4c5a-a067-c23db6e93eae","arxiv_id":"2607.23081","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":8.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"For every n≥5, S_2(G)=λ1+λ2 over n-vertex graphs is maximized uniquely by K_n^⋆, with S_2(K_n^⋆)=n−2+τ_n and S_2(K_n^⋆)≤8n/7−2, equality iff 7|n.","lead":"This paper determines, for every graph size n≥5, the exact largest possible sum of the two largest adjacency eigenvalues, and proves the extremal graph is unique. It resolves three conjectures in spectral graph theory, including the 2010 Aouchiche–Hansen conjecture and a 2026 conjecture of Kumar, Liu, Monterde, Pragada, and Tait.","discovery_kind":"first_principles","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified.","rationale":"The reader's ACCEPT verdict with high confidence is justified. The weakest assumption identified, Lemma 3.5, is exactly where a hidden flaw would have to live, but the proof survives stress-testing. The displayed inverse formula for C contains a scaling typo, yet the nonzero-pattern conclusion is unaffected, and the sign-variation argument uses only that pattern. The perturbation step that removes zero coefficients is sound because the relevant coefficient polynomials form a nonzero product whose zero set has empty interior. The subsequent transfer to chain graphs and the defect inequality are coherent, and the equality analysis appears free of circularity. I therefore find no honest reason to lower or raise the verdict.","tokens_in":15857,"tokens_out":34174,"duration_ms":304403,"concrete_test":"Numerically verify Lemma 3.5 for k=3,4 over random positive weights: build M_c, compute its eigenvalues, and evaluate T = sum_{3 <= i < j <= 2k+1} lambda_i lambda_j. If any random instance gives T > 0, the proof's technical heart fails; otherwise this corroborates the accepted verdict.","verdict_should_be":"UNCHANGED","load_bearing_attack":"I find no load-bearing flaw. The central claim requires the chain-graph reduction, the Ferrers tail inequality (Lemma 3.5), and the equality analysis to hold; I re-checked each. Lemma 3.5 is indeed the technical heart, but the sign/coefficient argument is internally consistent: the inverse of C is bidiagonal up to the displayed scaling typo, so the support graph really is a 2k+1-cycle; the principal-minor sign analysis and the variation-diminishing perturbation handle potential zeros legitimately. The transfer to chain graphs (Theorem 3.6), the uniform defect (Lemma 3.7), and the residue-dependent integer optimization (Proposition 2.3) also check out. I do not see a concrete failure mode that would move the verdict.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper determines the exact maximum of the spectral sum S_2(G)=λ_1+λ_2 over all simple graphs of order n≥5 and identifies the unique extremal graph K_n^*, defined as the complement of a suitably balanced complete bipartite graph plus isolated vertices. It further proves the sharp bound S_2(K_n^*)≤8n/7−2, with equality exactly when 7 divides n. The authors state that this resolves a conjecture of Kumar, Liu, Monterde, Pragada and Tait, strengthens the Aouchiche–Hansen conjecture, and subsumes the Ebrahimi–Mohar–Nikiforov–Ahmady conjecture. The proof combines Ky Fan's variational principle, a chain-graph reduction, a spectral-tail inequality for weighted Ferrers quotients, exact integer optimization of a three-parameter family, and a separate equality analysis.","tokens_in":16007,"tokens_out":41878,"duration_ms":378883,"significance":"If the proof is correct, the result is a clean finite-order extremal theorem with uniqueness, going beyond the asymptotic coefficient 8/7 and beyond the connected-graph setting. The argument is self-contained and parameter-free: no prior conjectures are used as input, and the extremal candidate is identified by optimizing an explicit family. The technical heart is Lemma 3.5, whose sign-variation and principal-minor machinery I checked with care; the integer optimization table, the τ_n bounds, the support-graph argument, and the uniform defect estimate are internally consistent. The paper does not provide machine-checked code, but the analytic proof is detailed enough for independent verification.","major_comments":[],"minor_comments":[{"comment":"The displayed formula for (C^{-1})_{ij} has the wrong scaling. For C_{ij}=√(p_i q_j) for j≤i, the inverse has reciprocal square roots, e.g. the diagonal entry is 1/√(p_i q_i) and the subdiagonal entry is −1/√(p_{i-1} q_i), not the printed expression. This does not affect the proof, because the subsequent inverse of M_c is justified via W y=x and only the zero pattern of C^{-1} is used for the support graph; nonetheless the displayed formula should be corrected.","section":"Lemma 3.5"},{"comment":"The table of R_{s_n−1} and R_{s_n} is correct but very hard to read in the manuscript because many entries are run together (for example, “2k+ 2k+ 1” and “−5k−2−13k−7”). It should be typeset as a proper table with clear column separators.","section":"Proposition 2.3"},{"comment":"The c=0 limiting argument is compressed: the ordered eigenvalues of M_ε depend continuously on ε, so the tail pair sum passes to the limit. Adding one sentence explaining this continuity would improve readability, especially because the tail sum involves only the eigenvalues after the two largest.","section":"Theorem 3.6"}],"recommendation":"minor_revision","confidential_remarks":"I agree with the positive assessment in the stress-test note. I found no load-bearing flaw: Lemma 3.5 is the technical heart, but its sign/coefficient argument is internally consistent, and the transfer to chain graphs, the uniform defect, and the equality analysis all check out. The only issues I identified are local presentation problems, including a scaling typo in a displayed inverse formula."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper closes a 15-year-old open problem: it gives the exact maximum of S2 over all graphs of each order n≥5 and proves uniqueness of the extremal graph K_n^*. That is a real result, not just a bound improvement. Prior work had the linear coefficient 8/7 and the connected-graph candidate, but the exact residue-dependent maximum and the equality classification were open. The proof lands cleanly: Ky Fan reduces edge-maximality to a threshold rule, the complement becomes a chain graph, and a new sign-variation argument on weighted Ferrers quotients produces the spectral-tail inequality that kills incidence rank ≥2. The integer optimization in Proposition 2.3 and the analytic bound in Lemma 2.4 are explicit and check out. The equality analysis is also carefully done, with the small connected-graph table handled directly. The authors are honest about what is new: they cite the 2008 and 2010 conjectures and the recent Kumar–Liu–Monterde–Pragada–Tait bound, and do not use any of those as input. There is no circularity and no parameter fitting. The soft spots are minor. Lemma 3.5 is the technical heart, and it is also the densest part of the paper. The displayed formula for C^{-1} has a typographical inconsistency (the entries look off by a scaling), but the zero pattern—which is all the support-graph argument needs—is correct. The perturbation argument that removes zero coefficients is legitimate: it treats the λ_i as independent variables, uses that coefficient signs persist in an open neighborhood, and Lemma 3.4 correctly identifies sign changes with positive roots. I also checked the rank-one interlacing in Lemma 3.7 and the defect inequality; they hold. The only place I would want a bit more exposition is the continuity argument in Theorem 3.6 for c=0, but the eigenvalues do depend continuously and the claim follows. Overall, the paper is coherent on its own terms. The central argument holds up. It deserves a serious referee, and I would expect it to be accepted after a light round of revisions that fix the display typo and perhaps expand the perturbation step in Lemma 3.5 for readability. I would cite this if I worked in extremal spectral graph theory.","headline":"Solid, self-contained proof of the exact spectral-sum maximum and uniqueness; resolves the conjectures and deserves a serious referee.","tokens_in":727,"tokens_out":628,"would_cite":true,"duration_ms":16124,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C50","05C35","15A18"],"pacs":[],"model":"deepseek-v4-flash","headline":"For every graph with n≥5 vertices, the sum of its two largest adjacency eigenvalues is maximized by a single explicit graph, K_n^*, and the paper pinpoints that graph exactly.","keywords":["spectral sum","adjacency eigenvalues","extremal graph","chain graph","Ferrers matrix","Ky Fan variational principle","incidence rank","graph energy"],"falsifier":"Compute the eigenvalues of the weighted Ferrers quotient M_c for a concrete incidence-rank-2 chain graph, for example k=2 with p_1=1, p_2=2, q_1=1, q_2=1, c=1, and check whether ∑_{3≤i 0. A single example with positive tail pairwise-product sum would disprove Lemma 3.5. Alternatively, an exhaustive search over all graphs of order 6, 7, or 8 comparing S_2(G) with S_2(K_n^*) would settle the theorem for those orders directly.","tokens_in":15742,"feed_emoji":"📊","tokens_out":3194,"duration_ms":30878,"temperature":0.7,"pith_summary":"The paper determines, for every order n≥5, the exact largest possible value of the sum of the two largest adjacency eigenvalues of a graph, and it identifies the unique graph attaining that value. The extremal graph K_n^* is the complement of a disjoint union of a balanced complete bipartite graph and isolated vertices, with the three part sizes determined by n modulo 7. The paper further proves that this maximum never exceeds 8n/7 − 2, with equality exactly when 7 divides n. This settles a conjecture that strengthened a 2010 conjecture and also subsumes a 2008 conjecture, completing the search for the exact finite-order maximum.","feed_headline":"Exact maximum found for sum of a graph's two top eigenvalues","feed_subtitle":"The unique extremal graph is the complement of a balanced bipartite graph plus isolated vertices, sized by n modulo 7.","key_machinery":"The central object is the weighted Ferrers quotient M_c (and its limit M_0), a (2k+1)×(2k+1) matrix built from block weights √p_i and √q_j and a lower-triangular chain support matrix; it captures the spectrum of the complement J−A(H) of a chain graph H up to additional zeros. The load-bearing identity is Lemma 3.5: for incidence rank k≥2, the sum of pairwise products of the tail eigenvalues λ_3,…,λ_{2k+1} is ≤0. The proof shows that the off-diagonal support graph of M_c^{-1} is a cycle, then uses a sign-variation stability argument on polynomial coefficients to force the second coefficient of the tail polynomial to be nonpositive. This inequality drives a uniform defect that excludes all cha","core_discovery":"Theorem 1.1 states that for every graph G of order n≥5, S_2(G) ≤ S_2(K_n^*), with equality if and only if G is isomorphic to K_n^*. The proof begins by choosing a maximizer with as many edges as possible and using Ky Fan's variational principle to convert edge-maximality into a threshold rule that forces the complement to be a chain graph. A new spectral-tail inequality for weighted Ferrers quotients then gives a uniform numerical defect whenever the complement has incidence rank at least two, ruling out all such cases. The complement therefore has incidence rank one, meaning the graph belongs to the family K(n,p,q); exact integer optimization over this family selects K_n^*. A separate equal","pith_inferences":["The compression of a chain graph to a weighted Ferrers quotient, combined with sign-variation control of the tail, may generalize to partial spectral sums S_k for fixed k>2; the same 7-periodic arithmetic could reappear for S_3.","A direct computational search over all graphs of small orders (e.g., n=6,7,8) comparing S_2 with S_2(K_n^*) would provide an independent, low-cost check of the theorem's core claim before relying on the full proof.","The 4/7 balance between the two nonadjacent parts emerges from a discrete optimization; one might test whether finite-order maxima for other fixed k produce similar rational proportions with periodic residues.","The proof's connectedness step is essential: the equality analysis uses the positivity of the Perron eigenvector of B(G), which fails for disconnected graphs; the paper's separate argument ruling out disconnected maximizers is what makes uniqueness possible."],"forward_implications":["The universal linear bound S_2(G) ≤ 8n/7 − 2 is now known to be sharp exactly when 7 divides n, and the precise finite-order maximum is known for every n≥5.","The unique extremal graph at each order belongs to the three-part family whose complement is a balanced complete bipartite graph plus isolated vertices; no other graph can tie it.","The result extends the earlier connected-graph conjecture to all graphs, adding a uniqueness clause that was previously missing.","A monotonicity lemma shows S_2(K_n^*) strictly increases with n, so the extremal value is a strictly increasing function of the order.","The equality analysis in the threshold rule rules out disconnected maximizers and any maximizer not isomorphic to K_n^*, giving a complete classification."],"fun_headline_variants":["Unique graph maximizes two-eigenvalue sum","Exact spectral sum peak: unique extremal graph","Two-eigenvalue sum solved: unique maximizer"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The whole reduction to incidence rank one rests on Lemma 3.5, which asserts that for a weighted Ferrers quotient with k≥2 the tail pairwise-product sum ∑_{3≤i 0. A single example with positive tail pairwise-product sum would disprove Lemma 3.5. Alternatively, an exhaustive search over all graphs of order 6, 7, or 8 comparing S_2(G) with S_2(K_n^*) would settle the theorem for those orders directly.","supporting_citations":[],"review_version":1}