Related papers: Construction of Cohen-Macaulay binomial edge ideal…
Let G be the circulant graph C_n(S) with S a subset of {1,2,...,\lfloor n/2 \rfloor}, and let I(G) denote its the edge ideal in the ring R = k[x_1,...,x_n]. We consider the problem of determining when G is Cohen-Macaulay, i.e, R/I(G) is a…
We provide the necessary and sufficient conditions for the edge-binomials of the tree forming a $d$-sequence in terms of the degree sequence notion of a graph. We study the regularity of powers of the binomial edge ideals of trees generated…
We present a class of homogeneous ideals which are generated by monomials and binomials of degree two and are set-theoretic complete intersections. This class includes certain reducible varieties of minimal degree and, in particular, the…
In this paper we study simplicial complexes as higher dimensional graphs in order to produce algebraic statements about their facet ideals. We introduce a large class of square-free monomial ideals with Cohen-Macaulay quotients, and a…
In this article, we survey the recent results on the Castelnuovo-Mumford regularity of binomial edge ideals and generalized binomial edge ideals. We also generalize some of the known upper bounds for binomial edge ideals to the case of…
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 extend the sortability concept to monomial ideals which are not necessarily generated in one degree and as an application we obtain normal Cohen-Macaulay toric rings attached to vertex cover ideals of graphs. Moreover, we consider a…
We introduce and study the concept which we call the splitting of a graph and compare algebraic properties of the edge ideals of graphs and those of their splitting graphs.
Given an arbitrary hypergraph $\mathcal{H}$, we may glue to $\mathcal{H}$ a family of hypergraphs to get a new hypergraph $\mathcal{H}'$ having $\mathcal{H}$ as an induced subhypergraph. In this paper, we introduce three gluing techniques…
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…
A monomial ideal $I$ is said to have homological linear quotients if for each $k\geq 0$, the homological shift ideal $\mathrm{HS}_k(I)$ has linear quotients. It is a well-known fact that if an edge ideal $I(G)$ has homological linear…
A central question in liaison theory asks whether every Cohen-Macaulay, graded ideal of a standard graded K-algebra belongs to the same G-liaison class of a complete intersection. In this paper we answer this question positively for toric…
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…
Let G be a simple undirected graph on n vertices, and let I(G) \subseteq R = k[x_1,...,x_n] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the…
We identify several classes of monomial ideals that possess minimal generalized Barile-Macchia resolutions. These classes of ideals include generic monomial ideals, monomial ideals with linear quotients, and edge ideals of hypertrees. We…
We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…
We calculate the minimal attached primes of the local cohomology modules of the binomial edge ideals of block graphs. In particular, we obtain a combinatorial characterisation of which of these modules are non-vanishing. We also show that…
In this paper we discuss the problem of characterizing the Cohen-Macaulay property of certain families of monomial ideals with fixed radical. More precisely, we consider generically complete intersection monomial ideals whose radical…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them 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…