English
Related papers

Related papers: A Lower Bound For Depths of Powers of Edge Ideals

200 papers

Lower bounds are given for the depths of R/I^t for t at least one when I is the edge ideal of a tree or forest. The bounds are given in terms of the diameter of the tree, or in case of a forest, the largest diameter of a connected component…

Commutative Algebra · Mathematics 2009-08-06 Susan Morey

Let $G$ be a graph and let $I := I (G)$ be its edge ideal. In this paper, we provide an upper bound of $n$ from which $\depth R/ I(G)^n$ is stationary, and compute this limit explicitly. This bound is always achieved if $G$ has no cycles of…

Commutative Algebra · Mathematics 2016-01-13 Tran Nam Trung

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…

Commutative Algebra · Mathematics 2023-08-03 Nguyen Cong Minh , Tran Nam Trung , Thanh Vu

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

Commutative Algebra · Mathematics 2022-02-28 S. A. Seyed Fakhari

For a finite simple graph $G$ we give an upper bound for the regularity of the powers of the edge ideal $I(G)$.

Commutative Algebra · Mathematics 2018-10-16 Jürgen Herzog , Takayuki Hibi

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…

Commutative Algebra · Mathematics 2022-09-15 Yijun Cui , Guangjun Zhu , Xiaoqi Wei

For a graph G, its rth power G^r has the same vertex set as G, and has an edge between any two vertices within distance r of each other in G. We give a lower bound for the number of edges in the rth power of G in terms of the order of G and…

Combinatorics · Mathematics 2012-02-29 Alexey Pokrovskiy

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…

Commutative Algebra · Mathematics 2024-01-05 Guangjun Zhu , Shiya Duan , Yijun Cui , Jiaxin Li

Let $I$ be the edge ideal of a connected non-bipartite graph and $R$ the base polynomial ring. Then $\operatorname{depth} R/I \ge 1$ and $\operatorname{depth} R/I^t = 0$ for $t \gg 1$. We give combinatorial conditions for…

Commutative Algebra · Mathematics 2023-01-24 Ha Thi Thu Hien , Ha Minh Lam , Ngo Viet Trung

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

Commutative Algebra · Mathematics 2025-01-28 Guangjun Zhu , Jiaxin Li , Yijun Cui , Yi Yang

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…

Commutative Algebra · Mathematics 2023-09-12 Nguyen Thu Hang , Truong Thi Hien , Thanh Vu

Let $G$ be a finite graph on $[n]:=\{1, \ldots, n\}$ and $\kappa(G)$ its vertex connectivity. Let $S=K[x_1, \ldots, x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I(G^c)$ the edge ideal of the complementary graph…

Commutative Algebra · Mathematics 2026-05-07 Takayuki Hibi , Seyed Amin Seyed Fakhari

Let $G$ be a graph and $I(G)$ its edge ideal. In this paper, we give a complete characterization of the graphs $G$ for which $\reg(R/I(G)) = 3$.

Commutative Algebra · Mathematics 2026-03-25 Akane Kanno

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…

Commutative Algebra · Mathematics 2025-09-11 Truong Thi Hien , Jiaxin Li , Tran Nam Trung , Guangjun Zhu

In this work, some combinatorial lower bound for regularity of powers of the edge ideal of a uniform hypergarph is gained. A family of hypergraphs whose regularity of edge ideal attains this bound and has a significant difference from the…

Commutative Algebra · Mathematics 2025-06-03 Fahimeh Khosh-Ahang Ghasr

Assume that $G$ is a graph with edge ideal $I(G)$ and star packing number $\alpha_2(G)$. We denote the $s$-th symbolic power of $I(G)$ by $I(G)^{(s)}$. It is shown that the inequality ${\rm depth} S/(I(G)^{(s)})\geq \alpha_2(G)-s+1$ is true…

Commutative Algebra · Mathematics 2020-09-30 S. A. Seyed Fakhari

Let $G$ be a simple graph on $n$ vertices. We introduce the notion of bipartite connectivity of $G$, denoted by $\operatorname{bc}(G)$ and prove that $$\lim_{s \to \infty} \operatorname{depth} (S/I(G)^{(s)}) \le \operatorname{bc}(G),$$…

Commutative Algebra · Mathematics 2024-06-19 Nguyen Cong Minh , Tran Nam Trung , Thanh Vu

Let $G$ be a graph with edge ideal $I(G)$. We recall the notions of $\min-match_{\{K_2, C_5\}}(G)$ and $\ind-match_{\{K_2, C_5\}}(G)$ from \cite{sy}. We show that $${\rm reg}(I(G)^s)\leq 2s+\min-match_{\{K_2, C_5\}}(G)-1,$$for all $s\geq…

Commutative Algebra · Mathematics 2019-05-14 Seyed Amin Seyed Fakhari , Siamak Yassemi

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. For all $s \geq 1$, we obtain upper bounds for reg$(I(G)^s)$ for bipartite graphs. We then compare the properties of $G$ and $G'$, where $G'$ is the graph…

Commutative Algebra · Mathematics 2016-09-07 A V Jayanthan , N Narayanan , S Selvaraja

Edge ideals of finite simple graphs are well-studied over polynomial rings. In this paper, we initiate the study of edge ideals over exterior algebras, specifically focusing on the depth and singular varieties of such ideals. We prove an…

Commutative Algebra · Mathematics 2022-08-09 Matthew Mastroeni , Jason McCullough , Andrew Osborne , Joshua Rice , Cole Willis
‹ Prev 1 2 3 10 Next ›