Related papers: A remark on sequentially Cohen-Macaulay monomial i…

Fix an integer $n \geq 1$, and consider the set of all connected finite simple graphs on $n$ vertices. For each $G$ in this set, let $I(G)$ denote the edge ideal of $G$ in the polynomial ring $R = K[x_1,\ldots,x_n]$. We initiate a study of…

We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is a cone over such a structure. We show that a simplicial tree…

Binomial edge ideals IG of a graph G were introduced by [4]. They found some classes of graphs G with the property that IG is a Cohen-Macaulay ideal. This might happen only for few classes of graphs. A certain generalization of being…

Inspired by the notion of K\"onig graphs we introduce graded ideals of K\"onig type with respect to a monomial order $<$. It is shown that if $I$ is of K\"onig type, then the Cohen--Macaulay property of $\ini_<(I)$ does not depend on the…

We study the depth of classes of binomial edge ideals and classify all closed graphs whose binomial edge ideal is Cohen--Macaulay.

In this paper, we introduce initially Cohen-Macaulay modules over a commutative Noetherian local ring $R$, a new class of $R$-modules that generalizes both Cohen-Macaulay and sequentially Cohen-Macaulay modules. A finitely generated…

We investigate Sharifan and Moradi's closed neighborhood ideal of a finite simple graph, which is a square-free monomial ideal in a polynomial ring over a field. We explicitly describe the minimal irreducible decompositions of these ideals.…

Let $S = K[x_1, \ldots, x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with each $\deg x_i = 1$ and $I \subset S$ a homogeneous ideal of $S$ with $\dim S/I = d$. The Hilbert series of $S/I$ is of the form…

We relate homological properties of a binomial edge ideal $\mathcal{J}_G$ to invariants that measure the connectivity of a simple graph $G$. Specifically, we show if $R/\mathcal{J}_G$ is a Cohen-Macaulay ring, then graph toughness of $G$ is…

Some recent investigations indicate that for the classification of Cohen-Macaulay binomial edge ideals, it suffices to consider biconnected graphs with some whiskers attached (in short, `block with whiskers'). This paper provides explicit…

We give a structure theorem for Cohen Macaulay monomial ideals of codimension 2, and describe all possible relation matrices of such ideals. In case that the ideal has a linear resolution, the relation matrices can be identified with the…

In this paper I give a combinatorial characterization of all the Cohen-Macaulay weighted chordal graphs. In particular, it is shown that a weighted chordal graph is Cohen- Macaulay if and only if it is unmixed.

Let $G$ be a finite simple graph, and $J_G$ denote the binomial edge ideal of $G$. In this article, we first compute the $\mathrm{v}$-number of binomial edge ideals corresponding to Cohen-Macaulay closed graphs. As a consequence, we obtain…

Let $G_\omega$ be an edge-weighted graph whose underlying graph is $G$. In this paper, we enlarge the class of Cohen-Macaulay edge-weighted graphs $G_\omega$ by classifying completely them when the graph $G$ has girth $5$ or greater.

The purpose of this note is to show that a finitely generated graded module $M$ over $S=k[x_1,\ldots,x_n]$, $k$ a field, is sequentially Cohen-Macaulay if and only if its arithmetic degree ${\rm adeg}(M)$ agrees with ${\rm adeg}(F/{\rm…

We show that if $G$ is a simple triangle-free graph with $n\geq 3$ vertices, without a perfect matching, and having a minimum degree at least $\frac{n-1}{2}$, then $G$ is isomorphic either to $C_5$ or to $K_{\frac{n-1}{2},\frac{n+1}{2}}$.

Let $D=(G,\mathcal{O},w)$ be a weighted oriented graph whose edge ideal is $I(D)$. In this paper, we characterize the unmixed property of $I(D)$ for each one of the following cases: $G$ is an $SCQ$ graph; $G$ is a chordal graph; $G$ is a…

In this note, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if $G$ is an $r$-partite Cohen-Macaulay graph which is covered by some disjoint cliques of…

We first construct the total simplicial complex (TSC) of a finite simple graph $G$ in order to generalize the total graph $T(G)$. We show that $\Delta_T(G)$ is not Cohen-Macaulay (CM) in general. For a connected graph $G$, we prove that the…

Given a tree T on n vertices, there is an associated ideal I of a polynomial ring in n variables over a field, generated by all paths of a fixed length of T. We show that such an ideal always satisfies the Konig property and classify all…