Related papers: Regularity of Edge Ideals Via Suspension

In a 2008 paper, the first author and Van Tuyl proved that the regularity of the edge ideal of a graph G is at most one greater than the matching number of G. In this note, we provide a generalization of this result to any square-free…

Assume that $G$ is a graph with edge ideal $I(G)$. For every integer $s\geq 1$, we denote the squarefree part of the $s$-th symbolic power of $I(G)$ by $I(G)^{\{s\}}$. We determine an upper bound for the regularity of $I(G)^{\{s\}}$ when…

We compute the Castelnuovo-Mumford regularity of the edge ideals of two families of circulant graphs, which includes all cubic circulant graphs. A feature of our approach is to combine bounds on the regularity, the projective dimension, and…

When M is a finitely generated graded module over a standard graded algebra S and I is an ideal of S, it is known from work of Cutkosky, Herzog, Kodiyalam, R\"omer, Trung and Wang that the Castelnuovo-Mumford regularity of I^mM has the form…

Let $G$ be a finite simple graph and let $I(G)$ denote its edge ideal. For $q \ge 1$, the $q$-th squarefree power $I(G)^{[q]}$ is generated by squarefree monomials corresponding to matchings of size $q$ in $G$. We denote by…

We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs. We prove the conjecture of Matsuda and Murai for graphs which has a cut edge or a…

Assume that $G$ is a graph with cover ideal $J(G)$. For every integer $k\geq 1$, we denote the $k$-th symbolic power of $J(G)$ by $J(G)^{(k)}$. We provide a sharp upper bound for the regularity of $J(G)^{(k)}$ in terms of the star packing…

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and let $I \subset S$ be a monomial ideal. For a vector $\mathfrak{c}\in\mathbb{N}^n$, we set $I_{\mathfrak{c}}$ to be the ideal generated by monomials…

Assume that $G$ is a graph with edge ideal $I(G)$ and let $I(G)^{(s)}$ denote the $s$-th symbolic power of $I(G)$. It is proved that for every integer $s\geq 1$, $${\rm reg}(I(G)^{(s+1)})\leq \max\bigg\{{\rm reg}(I(G))+2s, {\rm…

We study the Betti numbers of binomial edge ideal associated to some classes of graphs with large Castelnuovo-Mumford regularity. As an application we give several lower bounds of the Castelnuovo-Mumford regularity of arbitrary graphs…

Let $G$ be a unicyclic graph with edge ideal $I(G)$. For any integer $s\geq 1$, we denote the $s$-th symbolic power of $I(G)$ by $I(G)^{(s)}$. It is shown that ${\rm reg}(I(G)^{(s)})={\rm reg}(I(G)^s)$, for every $s\geq 1$.

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

We prove that the projective dimension of any (hyper)graph can be bounded from above by the (Castelnuovo-Mumford) regularity of its Levi graph (or incidence bipartite graph). This in particular brings the use of regularity's upper bounds on…

Let $G$ be a graph and let $I = I(G)$ be its edge ideal. When $G$ is unicyclic, we give a decomposition of symbolic powers of $I$ in terms of its ordinary powers. This allows us to explicitly compute the Waldschmidt constant and the…

We study chains of nonzero edge ideals that are invariant under the action of the monoid $\mathrm{Inc}$ of increasing functions on the positive integers. We prove that the sequence of Castelnuovo--Mumford regularity of ideals in such a…

Let $G$ be a graph and $I=I(G)$ be its edge ideal. When $G$ is the clique sum of two different length odd cycles joined at single vertex then we give an explicit description of the symbolic powers of $I$ and compute the Waldschmidt…

Let $G$ be the circulant graph $C_n(S)$ with $S\subseteq\{ 1,\ldots,\left \lfloor\frac{n}{2}\right \rfloor\}$ and let $I(G)$ be its edge ideal in the ring $K[x_0,\ldots,x_{n-1}]$. Under the hypothesis that $n$ is prime we : 1) compute the…

We study the topology of the lcm-lattice of edge ideals and derive upper bounds on the Castelnuovo-Mumford regularity of the ideals. In this context it is natural to restrict to the family of graphs with no induced 4-cycle in their…

Let $G$ be a simple graph and $I(X_G)=\varphi^{-1}(x_i^2-x_j^2 : i,j\in V_G)$, where $\varphi \colon K[E_G]\to K[V_G]$ is the homomorphism that sends an edge to the product of its vertices. The ideal $I(X_G)$ is Cohen--Macaulay,…

Castelnuovo-Mumford regularity is a measure of algebraic complexity of an ideal. Regularity of monomial ideals can be investigated combinatorially. We use a simple graph decomposition and results from structural graph theory to prove,…