pith. sign in

arxiv: 2605.01760 · v1 · submitted 2026-05-03 · 🧮 math.CO

Two-place Laplacian matching root integral variations are impossible

Pith reviewed 2026-05-10 14:39 UTC · model grok-4.3

classification 🧮 math.CO
keywords Laplacian matching rootsintegral variationsgraph theoryconjecturepower-sum identitiesconnected graphsmatching polynomial
0
0 comments X

The pith

No connected graph admits a two-place Laplacian matching root integral variation.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Wang, Cui, and Cioabă introduced Laplacian matching root integral variations and proved they cannot occur in one place. They also showed two-place variations are impossible for connected graphs with girth over cycle-space dimension exceeding 7/6, and conjectured the same holds for all connected graphs. This paper confirms the full conjecture by combining a structural relation from the earlier work with two new power-sum identities for the roots that together rule out every remaining case.

Core claim

The conjecture is confirmed: no connected graph admits a two-place Laplacian matching root integral variation. The proof proceeds from the structural relation that holds for every connected graph together with two newly established power-sum identities on the Laplacian matching roots.

What carries the argument

A structural relation for connected graphs combined with two new power-sum identities for Laplacian matching roots that suffice to exclude all possible two-place cases.

Load-bearing premise

The structural relation obtained in the prior paper holds for all connected graphs and the two new power-sum identities for Laplacian matching roots are valid and sufficient to rule out the remaining cases.

What would settle it

Discovery of any connected graph that exhibits a two-place Laplacian matching root integral variation, or a counterexample to one of the two new power-sum identities.

read the original abstract

Wang, Cui, and Cioab\u{a} introduced the Laplacian matching root integral variation of a graph and proved that it cannot occur in one place. They also showed that the two-place variation is impossible for connected graphs satisfying $g(G)/c(G)>7/6$, where $g(G)$ is the girth and $c(G)$ is the dimension of the cycle space, and conjectured that no connected graph admits such a two-place variation. In this paper, we confirm this conjecture. The proof combines a structural relation obtained in their paper with two new power-sum identities for Laplacian matching roots.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The paper confirms the conjecture of Wang, Cui, and Cioabă that no connected graph admits a two-place Laplacian matching root integral variation. The proof proceeds by applying a structural relation established in the authors' prior work and deriving two new power-sum identities satisfied by the Laplacian matching roots of any graph.

Significance. If the derivations hold, the result fully resolves the conjecture in spectral graph theory by ruling out the remaining cases after the structural relation is applied. This strengthens the toolkit of power-sum identities for analyzing integral properties of Laplacian spectra and matching roots, and may apply to related questions on graph invariants.

major comments (1)
  1. [Abstract and proof outline] The abstract states that the two new power-sum identities suffice to handle all cases not covered by the structural relation, but the manuscript must explicitly derive these identities (likely in the main proof section) and verify that they constrain the Laplacian matching roots for every connected graph satisfying the girth-cycle space condition or its complement.
minor comments (2)
  1. [Abstract] The abstract is concise but could briefly indicate the form of the two power-sum identities (e.g., the specific moments or sums involved) to orient readers before the detailed derivations.
  2. [Introduction] Ensure all citations to the prior paper (Wang-Cui-Cioabă) are complete and that the statement of the structural relation is reproduced verbatim or with clear reference to the relevant equation or theorem number from that work.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for recommending minor revision. We address the single major comment below.

read point-by-point responses
  1. Referee: [Abstract and proof outline] The abstract states that the two new power-sum identities suffice to handle all cases not covered by the structural relation, but the manuscript must explicitly derive these identities (likely in the main proof section) and verify that they constrain the Laplacian matching roots for every connected graph satisfying the girth-cycle space condition or its complement.

    Authors: The two new power-sum identities are derived explicitly in the main body of the proof (Section 3), immediately following the invocation of the structural relation from Wang, Cui, and Cioabă. The derivations appear as the central steps leading to the identities labeled (3.4) and (3.5). These identities are then applied uniformly to all connected graphs. A dedicated case analysis (Subsection 3.3) verifies that the resulting constraints rule out two-place Laplacian matching root integral variations both for graphs satisfying g(G)/c(G) ≤ 7/6 and for the complementary graphs, completing the proof of the conjecture. revision: no

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper confirms the conjecture by combining a structural relation cited from prior work with two new power-sum identities derived here. No step reduces a claimed result to its own inputs by construction, self-definition, or renaming; the new identities supply independent content, and the cited structural relation is an external theorem rather than an unverified self-reference that forces the outcome. The derivation chain is a standard reduction using prior result plus fresh identities, with no evidence of circularity under the specified patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the validity of two newly introduced power-sum identities and on the structural relation proved in the overlapping-author prior paper; no free parameters or invented entities appear in the abstract description.

axioms (2)
  • standard math Standard properties of the Laplacian matrix, matching polynomial, and cycle space of graphs
    Invoked throughout the proof as background from spectral graph theory.
  • domain assumption The structural relation between graphs that admit one-place and two-place variations
    Obtained in the prior paper by Wang, Cui, and Cioabă and used as the starting point for the new argument.

pith-pipeline@v0.9.0 · 5393 in / 1282 out tokens · 39630 ms · 2026-05-10T14:39:17.039298+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

10 extracted references · 10 canonical work pages

  1. [1]

    J. A. Ellis-Monaghan and C. Merino, Graph polynomials and their applications. II. Interrelations and interpretations, inStructural analysis of complex networks, Birkh¨ auser/Springer, New York, 2011, pp. 257–292

  2. [2]

    C. D. Godsil,Algebraic Combinatorics, Chapman and Hall Mathematics Series, Chapman and Hall, New York, 1993

  3. [3]

    C. D. Godsil and I. Gutman, On the matching polynomial of a graph, inAlgebraic Methods in Graph Theory, Vol. I, II (Szeged, 1978), Colloq. Math. Soc. J´ anos Bolyai, Vol. 25, North-Holland, Amsterdam, 1981, pp. 241–249

  4. [4]

    O. J. Heilmann and E. H. Lieb, Theory of monomer-dimer systems,Comm. Math. Phys.25(1972), 190–232

  5. [5]

    Kirkland, A characterization of spectral integral variation in two places for Laplacian matrices,Linear Multilinear Algebra52(2004), 79–98

    S. Kirkland, A characterization of spectral integral variation in two places for Laplacian matrices,Linear Multilinear Algebra52(2004), 79–98

  6. [6]

    Mohammadian, Laplacian matching polynomial of graphs,J

    A. Mohammadian, Laplacian matching polynomial of graphs,J. Algebraic Combin.52(2020), 33–39

  7. [7]

    So, Rank one perturbation and its application to the Laplacian spectrum of graphs,Linear Multilinear Algebra46(1999), 193–198

    W. So, Rank one perturbation and its application to the Laplacian spectrum of graphs,Linear Multilinear Algebra46(1999), 193–198

  8. [8]

    Wang, H.-J

    Y. Wang, H.-J. Cui, and S. M. Cioab˘ a, On integral variations for roots of the Laplacian matching polynomial of graphs,European J. Combin.132(2026), 104284

  9. [9]

    J.-C. Wan, Y. Wang, and A. Mohammadian, On the location of zeros of the Laplacian matching polynomials of graphs,J. Algebraic Combin.56(2022), 755–771

  10. [10]

    Zhang and H.-Y

    Y.-N. Zhang and H.-Y. Chen, The average Laplacian polynomial of a graph,Discrete Appl. Math.283 (2020), 737–743. Department of Mathematical Sciences, University of Delaware, Newark, DE 19716- 2553, USA Email address:cioaba@udel.edu School of Mathematical Sciences, Anhui University, Hefei 230601, Anhui, China Email address:liu@ahu.edu.cn School of Mathemat...