Regularity bound for squarefree parts of symbolic powers of edge ideals

From papers

Let GG be a graph, let I(G)I(G) denote its edge ideal, let I(G){s}I(G)^{\{s\}} denote the squarefree part of its ss-th symbolic power, and let match(G){\rm match}(G) denote the matching number of GG. Squarefree symbolic-power regularity conjecture. For every integer ss such that I(G){s}0I(G)^{\{s\}}\neq 0, one has

reg(I(G){s})match(G)+s.{\rm reg}(I(G)^{\{s\}})\leq {\rm match}(G)+s.

This proposes that the matching-number upper bound known in the source for squarefree powers should also hold for squarefree parts of symbolic powers. The source presents this as a conjecture and supplies no evidence of resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

S. A. Seyed Fakhari, “On the Regularity of squarefree part of symbolic powers of edge ideals”, arXiv:2303.02791 (2023).

Solutions 0

No solutions have been posted yet.