pith. sign in

arxiv: 1907.02743 · v1 · pith:WHS7E5EUnew · submitted 2019-07-05 · 🧮 math.AC · math.CO

Regularity of symbolic powers of edge ideals of Cameron-Walker graphs

S. A. Seyed Fakhari This is my paper

Pith reviewed 2026-05-25 01:52 UTC · model grok-4.3

classification 🧮 math.AC math.CO
keywords cameron-walkergraphmatchingnumberedgeind-matchinducedsymbolic
0
0 comments X

The pith

For Cameron-Walker graphs the regularity of the s-th symbolic power of the edge ideal equals 2s plus the induced matching number minus 1.

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

Cameron-Walker graphs are defined by the equality of their matching number and induced matching number. The paper proves that this equality produces an exact linear formula for the Castelnuovo-Mumford regularity of every symbolic power of the edge ideal: reg(I(G)^{(s)}) = 2s + ind-match(G) - 1. A reader cares because regularity encodes the highest degree appearing in the minimal free resolution, and symbolic powers arise naturally when studying primary decompositions and intersection multiplicities. The result therefore replaces a potentially heavy homological computation with a single graph invariant that is usually easy to read off.

Core claim

Assume that G is a Cameron-Walker graph with edge ideal I(G), and let ind-match(G) be the induced matching number of G. It is shown that for every integer s≥1, we have the equality reg(I(G)^{(s)})=2s+ind-match(G)−1, where I(G)^{(s)} denotes the s-th symbolic power of I(G).

What carries the argument

The equality of matching number and induced matching number, which forces the minimal generators and syzygies of the symbolic powers to have degrees controlled exactly by that common number.

If this is right

  • The regularity increases by exactly two when the exponent s increases by one.
  • The value depends only on the induced matching number of G and is independent of other graph features.
  • The same linear expression holds for every Cameron-Walker graph and every positive integer s.
  • Finding the regularity of these symbolic powers reduces to computing a single, purely combinatorial number.
  • pith_inferences=[
  • The same structural rigidity may produce exact formulas for other invariants such as depth or Castelnuovo-Mumford regularity of ordinary powers.
  • Graphs that nearly satisfy the Cameron-Walker condition could obey the formula up to a small additive error.
  • The result supplies a concrete test case for conjectures that attempt to bound regularity of symbolic powers in terms of induced matching number alone.

Load-bearing premise

The combinatorial equality between matching number and induced matching number holds, which forces the generators and syzygies of the symbolic powers to behave in a rigid, degree-controlled way.

What would settle it

Pick any explicit Cameron-Walker graph (for example a star with three leaves attached to a path of length two), compute the minimal free resolution of its second symbolic power directly, and check whether its regularity equals 5; any deviation falsifies the claimed equality.

read the original abstract

A Cameron-Walker graph is a graph for which the matching number and the induced matching number are the same. Assume that $G$ is a Cameron-Walker graph with edge ideal $I(G)$, and let $\ind-match(G)$ be the induced matching number of $G$. It is shown that for every integer $s\geq 1$, we have the equality ${\rm reg}(I(G)^{(s)})=2s+\ind-match(G)-1$, where $I(G)^{(s)}$ denotes the $s$-th symbolic power of $I(G)$.

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

0 major / 2 minor

Summary. The paper proves that if G is a Cameron-Walker graph (i.e., a graph whose matching number equals its induced matching number), then the Castelnuovo-Mumford regularity of the s-th symbolic power of its edge ideal satisfies reg(I(G)^{(s)}) = 2s + ind-match(G) - 1 for every integer s ≥ 1. The argument proceeds by establishing a matching lower bound that holds for arbitrary graphs and then proving a matching upper bound that exploits the rigid structure imposed by the Cameron-Walker condition on the minimal generators and syzygies of the symbolic powers.

Significance. If the result holds, it supplies an exact, closed-form expression for the regularity of symbolic powers of edge ideals within a combinatorially natural class of graphs. This is a concrete advance in the study of how graph invariants control algebraic invariants, and the proof is internal to the class with no free parameters or ad-hoc assumptions.

minor comments (2)
  1. [§2] §2, Definition 2.3: the statement that Cameron-Walker graphs are precisely the graphs with matching number equal to induced matching number is correct but would benefit from an explicit citation to the original Cameron-Walker paper for readers unfamiliar with the class.
  2. [Theorem 3.1] Theorem 3.1: the induction on s is clean, but the base case s=1 is dispatched by a reference to a prior result on edge ideals; a one-sentence reminder of that result would improve readability.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and the positive recommendation to accept. The report contains no major comments requiring a point-by-point response.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The derivation relies on the independent combinatorial definition of Cameron-Walker graphs (matching number equals induced matching number) together with the standard lower bound on regularity that holds for arbitrary graphs. The paper then establishes the matching upper bound by direct analysis of minimal generators and syzygies under this rigid structure. No equation reduces the claimed regularity back to a fitted parameter, a self-referential definition, or a load-bearing self-citation; the result is a genuine equality between independently defined graph-theoretic and algebraic quantities.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The claim rests on the definition of Cameron-Walker graphs (matching number equals induced matching number) and on standard facts from commutative algebra about edge ideals, symbolic powers, and Castelnuovo-Mumford regularity; no free parameters or new entities are introduced.

axioms (2)
  • standard math Standard properties of edge ideals and their symbolic powers in polynomial rings over fields
    Invoked implicitly when defining I(G) and I(G)^{(s)} and when speaking of their regularity.
  • domain assumption The combinatorial definition that a graph is Cameron-Walker precisely when its matching number equals its induced matching number
    This is the hypothesis under which the equality is claimed.

pith-pipeline@v0.9.0 · 5616 in / 1389 out tokens · 22217 ms · 2026-05-25T01:52:03.471408+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

24 extracted references · 24 canonical work pages

  1. [1]

    Alilooee , A

    A. Alilooee , A. Banerjee, Powers of edge ideals of regularity thre e bipartite graphs, J. Commut. Algebra, 9 (2017), 441–454

    work page 2017

  2. [2]

    Alilooee, S

    A. Alilooee, S. Beyarslan, S. Selvaraja, Regularity of powers of e dge ideal of unicyclic graphs, Rocky Mountain J. Math. , to appear

    work page

  3. [3]

    Banerjee, The regularity of powers of edge ideals, J

    A. Banerjee, The regularity of powers of edge ideals, J. Algebraic Combin. 41 (2015), 303–321

    work page 2015

  4. [4]

    Banerjee, S

    A. Banerjee, S. Beyarslan, H. T. H` a, Regularity of edge ideals a nd their powers, Springer Proceedings in Mathematics & Statistics 277 (2019), 17–52

    work page 2019

  5. [5]

    Banerjee, S

    A. Banerjee, S. Beyarslan, H. T. H` a, Regularity of powers of e dge ideals: from local properties to global bounds, preprint

    work page

  6. [6]

    Beyarslan, H

    S. Beyarslan, H. T. H` a, T. N. Trung, Regularity of powers of fo rests and cycles, J. Algebraic Combin. 42 (2015), 1077–1095

    work page 2015

  7. [7]

    Cameron, T

    K. Cameron, T. Walker, The graphs with maximum induced matching and maximum match- ingthe same size, Discrete Math. 299 (2005), 49–55

    work page 2005

  8. [8]

    H. Dao, C. Huneke, J. Schweig, Bounds on the regularity and pro jective dimension of ideals associated to graphs, J. Algebraic Combin. 38 (2013), 37–55

    work page 2013

  9. [9]

    Y. Gu, H. T. H` a, J. L. O’Rourke, J. W. Skelton, Symbolic powers o f edge ideals of graphs, preprint

    work page

  10. [10]

    H. T. H` a, Regularity of squarefree monomial ideals, In S.M. Cop per and S. Sather-Wagstaff(Ed.) Connections Between Algebra, Combinatorics, and Geometry. Spr inger Proceedings in Mathe- matics & Statistics 76 (2014), 251–276

    work page 2014

  11. [11]

    H. T. H` a, H. D. Nguyen, N. V. Trung, T. N. Trung, Symbolic pow ers of sums of ideals, Math. Z., to appear

    work page

  12. [12]

    Herzog, T

    J. Herzog, T. Hibi, Monomial Ideals , Springer-Verlag, 2011

    work page 2011

  13. [13]

    T. Hibi, A. Higashitani, K. Kimura, A. B. O’Keefe, Algebraic study o n Cameron-Walker graphs, J. Algebra 422 (2015), 257–269

    work page 2015

  14. [14]

    A. V. Jayanthan, R. Kumar, Regularity of symbolic powers of ed ge ideals, preprint

    work page

  15. [15]

    A. V. Jayanthan, N. Narayanan, S. Selvaraja, Regularity of p owers of bipartite graphs, J. Algebraic Combin., 47 (2018), 17–38

    work page 2018

  16. [16]

    Katzman, Characteristic-independence of Betti numbers of graph ideals, J

    M. Katzman, Characteristic-independence of Betti numbers of graph ideals, J. Combin. Theory, Ser. A 113 (2006), 435–454

    work page 2006

  17. [17]

    Khosh-Ahang, S

    F. Khosh-Ahang, S. Moradi, Regularity and projective dimensio n of edge ideal of C5–free vertex decomposable graphs, Proc. Amer. Math. Soc. 142 (2014), 1567–157

    work page 2014

  18. [18]

    Moghimian, S

    M. Moghimian, S. A. Seyed Fakhari, S. Yassemi, Regularity of pow ers of edge ideal of whiskered cycles, Comm. Algebra, 45 (2017), 1246–1259

    work page 2017

  19. [19]

    S. A. Seyed Fakhari, Symbolic powers of cover ideal of very well- covered and bipartite graphs, Proc. Amer. Math. Soc. , 146 (2018), 97–110

    work page 2018

  20. [20]

    S. A. Seyed Fakhari, Regularity of symbolic powers of edge ideals of chordal graphs, submitted

    work page

  21. [21]

    S. A. Seyed Fakhari, Regularity of symbolic powers of edge ideals of unicyclic graphs, submitted

    work page

  22. [22]

    S. A. Seyed Fakhari, S. Yassemi, Improved bounds for the reg ularity of edge ideals of graphs, Collect. Math. 69 (2018), 249–262. REGULARITY OF SYMBOLIC POWERS OF CAMERON-W ALKER GRAPHS 9

    work page 2018

  23. [23]

    Simis, W

    A. Simis, W. Vasconcelos, R. H. Villarreal, On the ideal theory ofg raphs, J. Algebra 167 (1994), 389–416

    work page 1994

  24. [24]

    Woodroofe, Matchings, coverings, and Castelnuovo-Mumf ord regularity, J

    R. Woodroofe, Matchings, coverings, and Castelnuovo-Mumf ord regularity, J. Commut. Algebra 6 (2014), 287–304. S. A. Seyed F akhari, School of Mathematics, Statistics and C omputer Science, College of Science, University of Tehran, Tehran, Iran, and Institute of Mathe- matics, Vietnam Academy of Science and Technology, 18 Hoang Quoc Viet, Hanoi, Vietnam. ...

    work page 2014