Sequentially Cohen-Macaulay Edge Ideals

For each squarefree monomial ideal $I\subset S = k[x_{1},\ldots, x_{n}] $, we associate a simple graph $G_I$ by using the first linear syzygies of $I$. In cases, where $G_I$ is a cycle or a tree, we show the following are equivalent: (a) $ I $ has a linear resolution (b) $ I $ has linear quotients (c) $ I $ is a variable-decomposable ideal In addition, with the same assumption on $G_I$, we characterize all monomial ideals with a linear resolution. Using our results, w...

The path ideal (of length t >=2) of a graph G is the monomial ideal, denoted I_t(G), whose generators correspond to the directed paths of length t in G. We study some of the algebraic properties of I_t(G) when G is a tree. We first show that I_t(G) is the facet ideal of a simplicial tree. As a consequence, the quotient ring R/I_t(G) is always sequentially Cohen-Macaulay, and the Betti numbers of R/I_t(G) do not depend upon the characteristic of the field. We study the case of...

We prove that cycles, wheels and block graphs have sequentially Cohen-Macaulay binomial edge ideals. Moreover, we provide a construction of new families of sequentially Cohen-Macaulay graphs by cones.

Let $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$ and $I$ be monomial ideal of $R$. In this paper, we show that if $I$ is a generic monomial ideal, then $R/I$ is pretty clean if and only if $R/I$ is sequentially Cohen-Macaulay. Furthermore, we prove that this equivalence remains unchanged for some special monomial ideals. Moreover, we provide an example that disproves the conjecture raised in \cite[p. 123]{S1} regarding generic monomial ideal...

The cut sets of a graph are special sets of vertices whose removal disconnects the graph. They are fundamental in the study of binomial edge ideals, since they encode their minimal primary decomposition. We introduce the class of accessible graphs as the graphs with unmixed binomial edge ideal and whose cut sets form an accessible set system. We prove that the graphs whose binomial edge ideal is Cohen-Macaulay are accessible and we conjecture that the converse holds. We settl...

We give a necessary and sufficient condition for a simplicial complex to be approximately Cohen-Macaulay. Namely it is approximately Cohen-Macaulay if and only if the ideal associated to its Alexander dual is componentwise linear and generated in two consecutive degrees. This completes the result of Herzog and Hibi who proved that a simplicial complex is sequentially Cohen-Macaulay if and only if the ideal associated to its Alexander dual is componentwise linear.

In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General bi-Cohen-Macaulay graphs are classified up to separation. The inseparable bi-Cohen-Macaulay graphs are determined. We establish a bijection between the set of all trees and the set of inseparable bi-Cohen-Macaulay graphs.

Conca and Varbaro (Invent. Math. 221 (2020), no. 3) showed the equality of depth of a graded ideal and its initial ideal in a polynomial ring when the initial ideal is square-free. In this paper, we give some beautiful applications of this fact in the study of Cohen-Macaulay binomial edge ideals. For a square-free monomial ideal $I$ and a variable $x$, we give a condition under which $I$ is Cohen-Macaulay if and only if $\big<I,x\big>$ is Cohen-Macaulay. Using this fact and c...

Two-dimensional squarefree monomial ideals can be seen as the Stanley-Reisner ideals of graphs. The main results of this paper are combinatorial characterizations for the Cohen-Macaulayness of ordinary and symbolic powers of such an ideal in terms of the associated graph.

We discuss algebraic and homological properties of binomial edge ideals associated to graphs which are obtained by gluing of subgraphs and the formation of cones.