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

From MaRDI portal
Publication:5124597

DOI10.1080/00927872.2020.1783673zbMATH Open1448.13029arXiv1907.02743OpenAlexW3038332066MaRDI QIDQ5124597FDOQ5124597


Authors: S. A. Seyed Fakhari Edit this on Wikidata


Publication date: 30 September 2020

Published in: Communications in Algebra (Search for Journal in Brave)

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).


Full work available at URL: https://arxiv.org/abs/1907.02743




Recommendations




Cites Work


Cited In (15)





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)