Regularity of Powers of edge ideal of very well-covered graphs
Abstract
Let k≥ 3 be an integer and G be a very well-covered graph with odd-girth(G)≥ 2k+1. Assume that I(G) is the edge ideal of G. We show that for every integer s with 1≤ s≤ k-2, we have reg(I(G)s)=2s+(G)-1, where (G) is the induced matching number of G.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.