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

From MaRDI portal
Publication:5124597




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 indmatch(G) be the induced matching number of G. It is shown that for every integer sgeq1, we have the equality mreg(I(G)(s))=2s+indmatch(G)1, where I(G)(s) denotes the s-th symbolic power of I(G).









This page was built for publication: Regularity of symbolic powers of edge ideals of Cameron-Walker graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124597)