Abstract:Abstract. In this paper we prove the existence of a special order on the set of minimal monomial generators of powers of edge ideals of arbitrary graphs. Using this order we find new upper bounds on the regularity of powers of edge ideals of graphs whose complement does not have any induced four cycle.
“…We prove various results of this type in the cases where there are results about the edge ideals, for example the gap free graphs, the claw free graphs and the cricket free graphs. Our main result is the following (compare this to the work done in [3] or [13]): Theorem 1.1. If G is gap free and claw free then for every t ≥ 3 the squarefree monomial ideal generated by t-paths I t (G) is either the zero ideal or has linear minimal free resolution.…”
Section: Introductionmentioning
confidence: 72%
“…Using this lemma repeatedly we get the following result, which is also a varsion of the Lemma 5.1 of [3]: Lemma 2.10. Let J ⊆ I be two monomial ideals in the polynomial ring S and I is generated in degree d by m 1 , ..., m k .…”
Section: Preliminariesmentioning
confidence: 77%
“…We refer reader to [3] and [6] for reference. Moreover, if m is a variable x appearing in I, then reg(I) is equal to one of these terms.…”
Section: Preliminariesmentioning
confidence: 99%
“…He proved that if G is both gap free and claw free then I(G) has regularity less than or equal to 3 and I(G) 2 has linear resolution. The author of this paper in generalized Nevo's result in [3] by proving if G is gap free and cricket free (see definition) then I(G) n has linear minimal free resolution for every n ≥ 2. Compare to these, the case of the path ideal seems to be relatively less explored but significant works on the regularity of the path ideals have been done in some recent works (for example in [1], [2] and [4]).…”
Abstract. In this paper we study the Castelnuovo-Mumford regularity of the path ideals of finite simple graphs. We find new upper bounds for various path ideals of gap free graphs. In particular we prove that the path ideals of gap free and claw graphs have linear minimal free resolutions.
“…We prove various results of this type in the cases where there are results about the edge ideals, for example the gap free graphs, the claw free graphs and the cricket free graphs. Our main result is the following (compare this to the work done in [3] or [13]): Theorem 1.1. If G is gap free and claw free then for every t ≥ 3 the squarefree monomial ideal generated by t-paths I t (G) is either the zero ideal or has linear minimal free resolution.…”
Section: Introductionmentioning
confidence: 72%
“…Using this lemma repeatedly we get the following result, which is also a varsion of the Lemma 5.1 of [3]: Lemma 2.10. Let J ⊆ I be two monomial ideals in the polynomial ring S and I is generated in degree d by m 1 , ..., m k .…”
Section: Preliminariesmentioning
confidence: 77%
“…We refer reader to [3] and [6] for reference. Moreover, if m is a variable x appearing in I, then reg(I) is equal to one of these terms.…”
Section: Preliminariesmentioning
confidence: 99%
“…He proved that if G is both gap free and claw free then I(G) has regularity less than or equal to 3 and I(G) 2 has linear resolution. The author of this paper in generalized Nevo's result in [3] by proving if G is gap free and cricket free (see definition) then I(G) n has linear minimal free resolution for every n ≥ 2. Compare to these, the case of the path ideal seems to be relatively less explored but significant works on the regularity of the path ideals have been done in some recent works (for example in [1], [2] and [4]).…”
Abstract. In this paper we study the Castelnuovo-Mumford regularity of the path ideals of finite simple graphs. We find new upper bounds for various path ideals of gap free graphs. In particular we prove that the path ideals of gap free and claw graphs have linear minimal free resolutions.
“…Computing and finding bounds for the regularity of edge ideals and their powers have been studied by a number of researchers (see for example [1], [2], [3], [5], [7], [11] and [12]). It is well-known that reg(I s ) is asymptotically a linear function for s ≫ 0.…”
Abstract. Let G = W (C n ) be a whiskered cycle graph with edge ideal I = I(G). We prove that for every s ≥ 1, the equality reg(I s ) = 2s + ⌈ n−1 2 ⌉ − 1 holds.
Let Δ be a one‐dimensional simplicial complex. Let be the Stanley–Reisner ideal of Δ. We prove that for all and all intermediate ideals J generated by and some minimal generators of , we have
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.