Abstract:Assume that G is a graph with edge ideal I(G) and matching number match(G). For every integer s ≥ 1, we denote the s-th squarefree power of I(G) by I(G) [s] . It is shown that for every positive integer s ≤ match(G), the inequality reg(I(G) [s] ) ≤ match(G) + s holds provided that G belongs to either of the following classes: (i) very well-covered graphs, (ii) semi-Hamiltonian graphs, or (iii) sequentially Cohen-Macaulay graphs. Moreover, we prove that for every Cameron-Walker graph G and for every positive … Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.