{"id":"24474bef-0b75-4636-bb9e-0367b50458c4","arxiv_id":"2412.06399","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For each a <= b and alpha in [0,1), the extremal K_{a,b}-minor-free graphs maximizing the A_alpha spectral radius are characterized.","lead":"For graphs that avoid K_{a,b} as a minor, this paper determines which graphs maximize the A_alpha spectral radius, a family of eigenvalue measures interpolating between adjacency and degree matrices. It generalizes a recently solved adjacency spectral extremal conjecture to a continuum of matrix parameters.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 4.1 is imported from [8,33] without re-proof; if it does not cover A_α-maximizers for all 2≤a≤b and α∈[0,1), the entire Section 4 structural reduction is unsupported.","rationale":"I agree with the reader's identification of Lemma 4.1 as the most fragile load-bearing premise. The whole proof of Theorem 1.4 is conditional on the existence of a clique dominating set of size a−1 in the A_α-extremal graph, and the manuscript does not contain a proof or a precise statement of the imported result. If the cited sources indeed prove the needed lemma for the A_α-index and the stated parameter ranges, then the central argument is plausibly sound and the remaining defects are mostly presentational. If they do not, Theorem 1.4 lacks a foundation. The unquantified 'large enough n' in Lemma 2.12(ii) is a related issue: the printed derivation of pXm^2 > qXM^2 and of xu > xv is not fully justified as written, since it drops a non-positive term, and the threshold needed may depend on a, b, α. However, this is likely repairable with a careful asymptotic argument, whereas Lemma 4.1 is a genuine external dependency. The reader's verdict was already CONDITIONAL, and this stress-test does not move it: the paper should either reproduce or explicitly verify Lemma 4.1 from the cited sources, tighten the 'large enough' quantifiers, and fix the internal inconsistencies in Section 5. If the suggested test confirms that [8,33] prove exactly the needed lemma, the conditional verdict can be upgraded.","tokens_in":38105,"tokens_out":12698,"duration_ms":132160,"concrete_test":"Retrieve [8, Theorem 1.2] and [33, Theorem 1.2] and check whether one of them states, for the A_α-spectral radius with α ∈ [0,1), that the extremal Ka,b-minor-free graph contains a clique dominating set of size a−1 for all 2≤a≤b and all sufficiently large n. If neither states this, supply a direct proof of Lemma 4.1 for α > 0 or exhibit a counterexample. As an independent computational check for the smallest nontrivial case, enumerate all K2,2-minor-free graphs on n ≤ 12 vertices, compute λ_α for α ∈ {0, 1/4, 1/2, 3/4, 99/100}, and verify that every maximizer has a universal vertex; a failure there would refute Lemma 4.1 in that range.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The most load-bearing premise is Lemma 4.1: the A_α-extremal graph G* has a clique dominating set S* of size a−1. Every subsequent argument in Section 4, including Lemmas 4.2–4.8 and the final case analysis of Theorem 1.4, is performed on G* − S* and depends on this decomposition. The paper does not prove Lemma 4.1; it cites [8,33] and says it is 'derived from the arguments' of those papers. It also does not state the exact imported theorem or verify that its hypotheses match the present setting: A_α-maximizers, all α ∈ [0,1), all 2 ≤ a ≤ b, n sufficiently large, and the class of all Ka,b-minor-free graphs, which need not be connected. If the cited results only cover α = 0, or only cover restricted a,b, or only connected graphs, then the structural reduction is not justified and the claimed extremal graphs in Theorem 1.4 could be wrong in some parameter range. This is not a cosmetic omission: without the clique dominating set, the exchange arguments in Section 4 have no starting point. A secondary, related fragility is the unquantified 'n is large enough' in Lemma 2.12(ii), where the proof drops the non-positive term α|S|(Xm − XM) and would need a careful uniform threshold; but the primary gap is the imported Lemma 4.1.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the A_alpha-spectral radius of K_{a,b}-minor-free graphs. It states two main extremal characterizations: Theorem 1.3 determines the connected K_{1,b}-minor-free extremal graph for n=b+1 and for b=3 or alpha>=2/(b+1) otherwise, and Theorem 1.4 determines the extremal graph for 2<=a<=b and sufficiently large n as either K_{a-1} vee ((k-t)K_b cup t F_{a,b}) or K_{a-1} vee (kK_b cup K_t), with the two exceptional cases t=tau=2 and t=2, tau=1, b=8. The proof combines the earlier structural framework of Zhai and Lin with A_alpha-specific Perron-vector estimates and exchange arguments. The final section derives the alpha=0 and alpha=1/2 cases as corollaries.","tokens_in":38355,"tokens_out":6679,"duration_ms":66167,"significance":"If correct, Theorem 1.4 is a substantial extension of the Zhai-Lin resolution of Tait's adjacency conjecture to the entire A_alpha-family, with explicit extremal graphs in every case. The derivation of the alpha=0 and alpha=1/2 specializations from the new theorem is a genuine consistency check rather than a fitting exercise, since no parameters are tuned to match those known results. The main risks are the imported structural lemma used to start the Section 4 analysis and the unquantified large-n estimates on Perron-vector sums, both of which are load-bearing for the proof as written.","major_comments":[{"comment":"The statement that the extremal graph G* has a clique dominating set S* of cardinality a-1 is imported from [8,33] without being re-proved and without quoting the exact theorem used. All subsequent lemmas in Section 4 and the final case analysis of Theorem 1.4 operate on G*-S*, so this decomposition is the structural starting point of the whole proof. The authors should state the precise result they import, verify that its hypotheses cover the present setting (A_alpha-maximizers for all alpha in [0,1), all 2<=a<=b, n sufficiently large, and possibly disconnected K_{a,b}-minor-free graphs), or give a self-contained proof. As written, a reader cannot tell whether the cited results apply only to alpha=0 or only to connected graphs, and if the lemma fails the claimed extremal graphs in Theorem 1.4 could change.","section":"Section 4, Lemma 4.1"},{"comment":"The proof asserts the strict inequalities pX_m > qX_M and pX_m^2 > qX_M^2 for 'n is large enough' without quantifying the threshold, and the displayed derivation for the square inequality replaces p and q by sqrt p and sqrt q in the final lower bound without justification. These inequalities are invoked in virtually every exchange argument in Section 4, including Lemmas 4.2, 4.5, and Claims 8-10, so the proof needs an explicit uniform bound of the form n > N(a,b,c,p,q,alpha) and a corrected algebraic justification of the final inequality. The current unquantified language is too fragile for a proof whose later steps depend on the strictness of these comparisons.","section":"Section 2, Lemma 2.12(ii)"}],"minor_comments":[{"comment":"Corollary 5.3 states tau = floor((a+1)/(b+1)), which is inconsistent with the definition tau = floor((b+1)/(a+1)) used in Theorem 1.4 and throughout Section 4. As printed, the alpha=1/2 specialization does not match the theorem it claims to specialize.","section":"Section 5, Corollary 5.3"},{"comment":"Corollary 5.1 says 'In Theorem 1.3, let alpha=0 and a=2', but Theorem 1.3 concerns the K_{1,b} case; the case a=2 belongs to Theorem 1.4. The cross-reference should be corrected.","section":"Section 5, Corollary 5.1"},{"comment":"The conclusion of Lemma 4.4(i) is printed as 'F_{>t+3} = empty set', but the proof and the surrounding text concern components of order larger than b+3. This appears to be a typo for 'F_{>b+3}'.","section":"Section 4, Lemma 4.4(i)"},{"comment":"There are several small typographical issues, such as 'oder' in Lemma 2.8, 'Combing' for 'Combining', and 'Our manuscript has no associated date' in the Data availability statement. These do not affect the mathematics but should be cleaned up.","section":"Throughout"}],"recommendation":"major_revision","confidential_remarks":"The central theorem is credible and the special-case reductions are a useful feature, but the proof's reliability rests on Lemma 4.1, which is imported without a statement of the exact result or verification of its hypotheses. I would recommend that the editor obtain a second opinion on whether [8,33] indeed cover A_alpha-maximizers in the full parameter range, since this is the main correctness risk. The unquantified large-n estimates in Lemma 2.12 should also be tightened before publication."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper is a genuine advance: it extends the Zhai-Lin adjacency-spectral characterization of K_{a,b}-minor-free extremal graphs to the whole A_alpha family, and Theorem 1.4 is the first complete result of that kind for 2 <= a <= b. At alpha=0 it reproduces the known adjacency theorem and at alpha=1/2 it recovers Q-index results, so the claimed generality is real, not a reformulation. The proof is a long but structured case analysis, and the special-case checks I did (alpha=0, b=2,3, t=0, the Petersen exception) are consistent. This deserves referee time.\n\nThat said, the paper as written has three issues. First, Theorem 1.3 is stated for connected K_{1,b}-minor-free graphs, but the n=b+1 extremal F_{1,b} is a disjoint union of stars (a matching when a=1), not connected. Either the word 'connected' should be dropped for that case or the extremal needs a different definition. That is a real statement-level bug. Second, Section 5 is sloppy: it says 'in Theorem 1.3, let alpha=0 and a=2' when the relevant statement is Theorem 1.4, and Corollary 5.3 has tau = floor((a+1)/(b+1)), which is inverted; these are fixable but they undermine trust in the internal consistency. Third, Lemma 4.1 — the clique dominating set decomposition at the heart of Section 4 — is imported from [8,33] without proof or a precise statement of the hypotheses. The abstract says the proof is self-contained, but the one structural fact that makes the entire component analysis work is not. If [8] actually covers A_alpha-maximizers for all 2 <= a <= b, then this is an exposition gap; if not, the theorem is unsupported. A referee needs to check that citation carefully.\n\nThe 'n is large enough' clause is also unquantified, as in the source literature, but here it is doing real work in Lemma 2.12(ii), so explicit thresholds would be better.\n\nBottom line: likely correct and important to the subfield, but it needs revision. I would send it to a serious referee and expect heavy revision.","headline":"A credible and important A_alpha generalization of Zhai-Lin, with a real statement bug in Theorem 1.3 and an imported structural lemma that needs verification.","tokens_in":38967,"tokens_out":3239,"would_cite":true,"duration_ms":31999,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05C50","05C83","05C35"],"pacs":[],"model":"deepseek-v4-flash","headline":"Complete A_alpha extremal graphs found for K_{a,b}-minor-free graphs","keywords":["A_alpha-spectral radius","K_{a,b}-minor free graphs","spectral Turan problem","Perron vector","clique dominating set","signless Laplacian","star forest","Tait conjecture"],"falsifier":"Fix a small case such as (a,b)=(2,5) and alpha=0.9, and for a range of n near the claimed threshold enumerate all n-vertex K_{2,5}-minor-free graphs whose Perron-vector computation is feasible; if any graph without a clique dominating set of size 1 has A_alpha-spectral radius larger than K_1 joined to ((k-t)K_5 cup tF_{2,5}) (or than the stated t=2 exception), the theorem is false. Alternatively, check whether Lemma 4.1's conclusion holds for the true A_alpha extremal at alpha close to 1 by direct computation.","tokens_in":37846,"feed_emoji":"🕸️","tokens_out":7246,"duration_ms":64559,"temperature":0.7,"pith_summary":"This paper asks which n-vertex graph without a K_{a,b} minor has the largest A_alpha-spectral radius, the one-parameter family A_alpha(G)=alpha D(G)+(1-alpha)A(G) that interpolates between the adjacency matrix (alpha=0) and the signless Laplacian (alpha=1/2). The paper's claim is that for 1<=a<=b and alpha in [0,1), with n large enough, the answer is explicit and unique: apart from two sporadic exceptional graphs, it is always a clique K_{a-1} joined to a disjoint union of complete graphs K_b and star forests F_{a,b}, with a separate connected K_{1,b} result. If correct, this resolves the A_alpha version of Tait's spectral Turan conjecture for complete bipartite minors and unifies the previously separate adjacency and Q-spectral extremal theorems into one statement.","feed_headline":"Complete A_alpha extremal graphs found for K_{a,b}-minor-free graphs","feed_subtitle":"For every alpha in [0,1), a unique join-of-cliques graph wins for large n, unifying adjacency and Q-spectral results.","key_machinery":"The carrying object is the A_alpha matrix A_alpha(G)=alpha D(G)+(1-alpha)A(G) together with its Perron vector x, which satisfies lambda_alpha x_v = alpha d(v)x_v + (1-alpha) sum_{u~v} x_u. The proof forces the extremal graph to decompose as a clique dominating set S* of size a-1 (Lemma 4.1, imported from prior work) plus components that must have the (a,b)-property, meaning they are K_{r,s}-minor-free for every r+s=b+1 with r<=omega. The engine is Lemma 2.12, which uses Perron-vector lower and upper bounds to show that for large n any edge-density-raising replacement inside a small component strictly raises the A_alpha-spectral radius; combining this with double-eigenvector comparisons (Lemmas 2.4 and 2.5) pins each component to K_b, F_{a,b}, F(a,0,b-1-a), or the Petersen graph.","core_discovery":"For the connected K_{1,b}-minor-free case (Theorem 1.3), the paper proves that for n=b+1 the extremal graph is F_{1,b} for every alpha in [0,1), while for n != b+1 it is S_{n-b}(K_b) when b=3 and alpha in [0,1) or when b>=4 and alpha in [2/(b+1),1). For 2<=a<=b (Theorem 1.4), writing n-a+1=kb+t with 0<=t<=b-1 and tau=floor((b+1)/(a+1)), the paper proves that for large n the unique extremal graph has the form K_{a-1} joined to ((k-t)K_b cup tF_{a,b}) when t<=2(tau-1), and K_{a-1} joined to (kK_b cup K_t) when t>=2tau-1. The two exceptions are t=tau=2, where the component F(a,0,b-1-a) replaces one F_{a,b}, and t=2,tau=1,b=8, where the Petersen graph replaces K_2. These statements are given for every alpha in [0,1).","pith_inferences":["The open range in Theorem 1.3 suggests that for alpha below 2/(b+1) the extremal connected K_{1,b}-minor-free graph may depend on alpha; a testable conjecture is that it switches from S_{n-b}(K_b) to another graph at a threshold that may not equal 2/(b+1).","If Lemma 4.1 were proved directly for the A_alpha extremal, the whole argument would become self-contained and would likely extend to alpha=1 and to other minor families where a clique dominating set can be forced.","A quantitative bound on 'n large enough' would turn the theorem into an algorithmic tool: for explicit n one could certify the winner by checking finitely many component patterns, since all components have size at most b+2.","The same Perron-vector separation technique should apply to other forbidden complete bipartite subgraphs or minors where an analogous edge-density bound is available."],"forward_implications":["For every alpha in [0,1) and sufficiently large n, the maximizing graph is unique and has the same join-of-cliques/star-forest form as the adjacency extremal, so the alpha-parameter does not create new extremal shapes except the two sporadic cases.","Setting alpha=0 recovers Zhai and Lin's complete resolution of Tait's conjecture; setting alpha=1/2 recovers the recent Q-spectral extremal characterizations for K_{a,b}-minor-free graphs.","For connected K_{1,b}-minor-free graphs, the extremal is the subdivision graph S_{n-b}(K_b) whenever alpha is at least 2/(b+1), and the small-alpha regime is explicitly left open for b>=4 and alpha in (0, 2/(b+1)).","The structural dichotomy t<=2(tau-1) versus t>=2tau-1 is inherited from the adjacency case, meaning the A_alpha result does not change the phase transition in the remainder t."],"supporting_citations":[{"why":"Supplies the complete adjacency-spectral resolution of the K_{a,b}-minor problem that this paper generalizes, including the same exceptional graphs and the (a,b)-property lemmas.","marker":"[36]"},{"why":"States the conjecture being extended to A_alpha and contributes the structural argument used in Lemma 4.1 for adjacency.","marker":"[33]"},{"why":"Imported as the source of Lemma 4.1, the clique dominating set assertion on which the a>=2 proof rests.","marker":"[8]"},{"why":"Introduces the A_alpha matrix and the basic monotonicity and degree bounds used at the start of the proof.","marker":"[31]"},{"why":"Supplies the Perron-vector and majorization lemmas (Lemma 2.4 and 2.13) that power the edge-exchange comparisons.","marker":"[32]"},{"why":"Provides the edge bound for connected K_{1,b}-minor-free graphs used to control components outside the main cliques.","marker":"[11, 12]"},{"why":"The Q-spectral extremal result derived as a corollary at alpha=1/2, showing the theorem subsumes a recent separate result.","marker":"[39]"}],"fun_headline_variants":["A_alpha-spectral extremal graphs for K_{a,b}-minor-free graphs fully characterized","Complete A_alpha extremal characterization for K_{a,b}-minor-free graphs","A_alpha radius extremal graphs for K_{a,b}-minor-free graphs fully resolved","One A_alpha extremal result ties adjacency and Q-spectral cases","A_alpha extremal graphs for K_{a,b}-minor-free: full characterization"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof assumes, via an imported lemma that is not re-proved here, that the extremal graph for a>=2 contains a clique of a-1 dominating vertices, and it also assumes an unquantified 'n large enough' threshold that makes the Perron-vector sums strictly ordered; if either premise fails in some parameter range, the claimed extremal graphs could be different.","fun_headline_variants_meta":{"raw":{"variants":["A_alpha-spectral extremal graphs for K_{a,b}-minor-free graphs fully characterized","Complete A_alpha extremal characterization for K_{a,b}-minor-free graphs","A_alpha radius extremal graphs for K_{a,b}-minor-free graphs fully resolved","One A_alpha extremal result ties adjacency and Q-spectral cases","A_alpha extremal graphs for K_{a,b}-minor-free: full characterization"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.0012,"raw_usage":{"total_tokens":4949,"prompt_tokens":950,"completion_tokens":3999,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":566,"completion_tokens_details":{"reasoning_tokens":3889}},"tokens_in":566,"tokens_out":3999,"duration_ms":28233,"temperature":1.0,"reasoning_tokens":3889,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T19:43:24.817329+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Fix a small case such as (a,b)=(2,5) and alpha=0.9, and for a range of n near the claimed threshold enumerate all n-vertex K_{2,5}-minor-free graphs whose Perron-vector computation is feasible; if any graph without a clique dominating set of size 1 has A_alpha-spectral radius larger than K_1 joined to ((k-t)K_5 cup tF_{2,5}) (or than the stated t=2 exception), the theorem is false. Alternatively, check whether Lemma 4.1's conclusion holds for the true A_alpha extremal at alpha close to 1 by direct computation.","supporting_citations":[{"cited_title":"Zhai, H.Q","cited_arxiv_id":null,"evidence_quote":"Supplies the complete adjacency-spectral resolution of the K_{a,b}-minor problem that this paper generalizes, including the same exceptional graphs and the (a,b)-property lemmas."},{"cited_title":"Tait, The Colin de Verdi` ere parameter, excluded minors, an d the spectral radius, J","cited_arxiv_id":null,"evidence_quote":"States the conjecture being extended to A_alpha and contributes the structural argument used in Lemma 4.1 for adjacency."},{"cited_title":"Chen, A.M","cited_arxiv_id":null,"evidence_quote":"Imported as the source of Lemma 4.1, the clique dominating set assertion on which the a>=2 proof rests."},{"cited_title":"Nikiforov, O","cited_arxiv_id":null,"evidence_quote":"Supplies the Perron-vector and majorization lemmas (Lemma 2.4 and 2.13) that power the edge-exchange comparisons."},{"cited_title":"A generalization on spectral extrema of $K_{s,t}$-minor free graphs","cited_arxiv_id":"2211.11142","evidence_quote":"The Q-spectral extremal result derived as a corollary at alpha=1/2, showing the theorem subsumes a recent separate result."}],"review_version":1}