Related papers: Eulerian ideals

In this paper, we mainly study the Castelnuovo-Mumford regularity of the generalized binomial edge ideals of graphs. We show that this number can be any integer number from $2$ to $n-1$ where $n$ is the number of vertices in the underlying…

A famous theorem of Kalai and Meshulam is that $\mathrm{reg}(I + J) \leq \mathrm{reg}(I) + \mathrm{reg}(J) -1$ for any squarefree monomial ideals $I$ and $J$. This result was subsequently extended by Herzog to the case where $I$ and $J$ are…

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal in a polynomial ring over a field $\mathbb{K}$. In this paper, we obtain upper bounds for the Castelnuovo-Mumford regularity of symbolic powers of certain…

Let $G$ be a simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in $S = K[x_1, \ldots, x_n, y_1,\ldots, y_n].$ We prove that the Castelnuovo-Mumford regularity of $J_G$ is bounded above by $c(G)+1$ when $G$…

We survey recent studies on the Castelnuovo-Mumford regularity of edge ideals of graphs and their powers. Our focus is on bounds and exact values of $\text{reg} I(G)$ and the asymptotic linear function $\text{reg} I(G)^q$, for $q \geq 1,$…

Let $G$ be a graph with $n$ vertices, $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over a field $\mathbb{K}$ and $I(G)$ denote the edge ideal of $G$. For every collection $\mathcal{H}$ of connected graphs with…

Let $G$ be a finite simple graph with the vertex set $V$ and let $I_G$ be its edge ideal in the polynomial ring $S=\mathbb{K}[x_V]$. In this paper, we compute the depth and the Castelnuovo--Mumford regularity of $S/I_G$ when $G=G_1\circ…

For all integers $4 \leq r \leq d$, we show that there exists a finite simple graph $G= G_{r,d}$ with toric ideal $I_G \subset R$ such that $R/I_G$ has (Castelnuovo-Mumford) regularity $r$ and $h$-polynomial of degree $d$. To achieve this…

Let $I(G)$ be the edge ideal of a bicyclic graph. In this paper, we characterize the Castelnuovo-Mumford regularity of $I(G)$ in terms of the induced matching number of $G$. For the base case of this family of graphs, i.e. dumbbell graph,…

In this paper, we provide exact formulas for the Castelnuovo-Mumford regularity of powers of an almost complete intersection ideal $I$ which is generated by a homogeneous $d$-sequence. As applications, when $I$ is an almost complete…

We give a bound on the Castelnuovo-Mumford regularity of a homogeneous ideals I, in a polynomial ring A, in terms of number of variables and the degrees of generators, when the dimension of A/I is at most two. This bound improves the one…

Assume that $G$ is a graph with edge ideal $I(G)$ and matching number ${\rm match}(G)$. For every integer $s\geq 1$, we denote the $s$-th squarefree power of $I(G)$ by $I(G)^{[s]}$. It is shown that for every positive integer $s\leq {\rm…

Let $G$ be a finite simple connected graph on $[n]$ and $R = K[x_1, \ldots, x_n]$ the polynomial ring in $n$ variables over a field $K$. The edge ideal of $G$ is the ideal $I(G)$ of $R$ which is generated by those monomials $x_ix_j$ for…

Let $G$ be a $(C_4, 2K_2)$-free graph with edge ideal $I(G)\subset \Bbbk[x_1,\dots , x_n]$. We show that $I(G)^s$ has linear resolution for every $s\geq 2$. Also, we show that every power of the vertex cover ideal of $G$ has linear…

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,…

We classify all graphs $G$ satisfying the property that all matching powers $I(G)^{[k]}$ of the edge ideal $I(G)$ are bi-Cohen-Macaulay for $1\le k\le\nu(G)$, where $\nu(G)$ is the maximum size of a matching of $G$.

We classify generalized block graphs whose binomial edge ideals admit a unique extremal Betti number. We prove that the Castelnuovo-Mumford regularity of binomial edge ideals of generalized block graphs is bounded below by $m(G)+1$, where…

Let $G$ be a finite simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in $S = K[x_1, \ldots, x_n, y_1, \ldots, y_n].$ In this article, we prove that if $G$ is a fan graph of a complete graph, then…

We study the Castelnuovo-Mumford regularity of the vanishing ideal over a bipartite graph endowed with a decomposition of its edge set. We prove that, under certain conditions, the regularity of the vanishing ideal over a bipartite graph…

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…