For any Cameron-Walker graph G, reg(I(G)^{(s)}) = 2s + ind-match(G) - 1 holds for every integer s ≥ 1.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Regularity of symbolic powers of edge ideals of Cameron-Walker graphs
For any Cameron-Walker graph G, reg(I(G)^{(s)}) = 2s + ind-match(G) - 1 holds for every integer s ≥ 1.