Related papers: Depth of powers of integrally closed edge ideals o…

This paper gives some exact formulas for the depth of powers of the edge ideal of an edge-weighted integrally closed cycle.

We provide exact formulas for the depth of the quotient ring of powers of the edge ideal of an increasing weighted path.

This paper presents exact formulas for the regularity and depth of powers of edge ideals of an edge-weighted star graph. Additionally, we provide exact formulas for the regularity of powers of the edge ideal of an edge-weighted integrally…

This paper gives exact formulas for the regularity of powers of edge ideals of an edge-weighted integrally closed cycle.

This paper gives exact formulas for the regularity of edge ideals of edge-weighted integrally closed trees. In addition, we provide some linear upper bounds on the regularity of powers of such ideals.

Let $G=P_n$ be a path graph with cover ideal $J(P_n)$. By using Hochster's depth formula, we prove the explicit formulae to compute the depth functions of powers of cover ideals of paths.

In this paper, we describe primary decomposition of the edge ideal of the join of some graphs in terms of that information of the edge ideal of every weighted oriented graph. Meanwhile, we also study depth and regularity of symbolic powers…

For an increasing weighted tree $G_\omega$, we obtain an asymptotic value and a sharp bound on the index stability of the depth function of its edge ideal $I(G_\omega)$. Moreover, if $G_\omega$ is a strictly increasing weighted tree, we…

Let $G$ be a graph and let $I$ be the edge ideal of $G$. Our main results in this article provide lower bounds for the depth of the first three powers of $I$ in terms of the diameter of $G$. More precisely, we show that $\depth R/I^t \geq…

Assume that $G$ is a graph with edge ideal $I(G)$. We provide sharp lower bounds for the depth of $I(G)^2$ in terms of the star packing number of $G$.

We study powers of binomial edge ideals associated with closed and block graphs.

Let $I$ be the edge ideal of a cycle of length $n \ge 5$ over a polynomial ring $S = \mathrm{k}[x_1,\ldots,x_n]$. We prove that for $2 \le t < \lceil (n+1)/2 \rceil$, $$\operatorname{depth} (S/I^t) = \lceil \frac{n -t + 1}{3} \rceil.$$ When…

We compute the Betti numbers for all the powers of initial and final lexsegment edge ideals. For the powers of the edge ideal of an anti-$d-$path, we prove that they have linear quotients and we characterize the normally torsion-free…

In this paper we provide some exact formulas for the regularity of powers of edge ideals of vertex-weighted oriented cycles and vertex-weighted unicyclic graphs. These formulas are functions of the weight of vertices and the number of…

We determine all possible triples of depth, dimension, and regularity of edge ideals of weighted oriented graphs with a fixed number of vertices. Also, we compute all the possible Betti table sizes of edge ideals of weighted oriented trees…

Let $I$ be the edge ideal of a Cohen-Macaulay tree of dimension $d$ over a polynomial ring $S = \mathrm{k}[x_1,\ldots,x_{d},y_1,\ldots,y_d]$. We prove that for all $t \ge 1$, $$\operatorname{depth} (S/I^t) = \operatorname{max} \{d -t + 1, 1…

We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.

We classify all normal edge ideals of edge-weighted graphs.

We prove that the regularity of edge ideals of powers of forests is weakly decreasing. We then compute the regularity of edge ideals of powers of cycles.

The index of a graded ideal measures the number of linear steps in the graded minimal free resolution of the ideal. In this paper we study the index of powers and squarefree powers of edge ideals. Our results indicate that the index as a…