相关论文: Sequentially Cohen-Macaulay Edge Ideals

Let $G$ be a simple undirected graph on $n$ vertices. Francisco and Van Tuyl have shown that if $G$ is chordal, then $\bigcap_{\{x_i,x_j\}\in E_G} < x_i,x_j>$ is componentwise linear. A natural question that arises is for which $t_{ij}>1$…

In this paper, we prove that the open neighborhood ideal of a TD-unmixed tree is geometrically vertex decomposable. This result implies that the associated Stanley-Reisner complex is vertex decomposable. We further demonstrate that…

We classify the Cohen-Macaulay binomial edge ideals of cactus and bicyclic graphs.

For a non-negative integer $k$, let $\mathrm{HS}_{k}(J(G))$ denote the $k^{\text{th}}$ homological shift ideal of the vertex cover ideal $J(G)$ of a graph $G$. For each $k\geq 2$, we construct a Cohen-Macaulay very well-covered graph $G_k$…

In 1999 Herzog and Hibi introduced componentwise linear ideals. A homogeneous ideal $I$ is componentwise linear if for all non-negative integers $d$, the ideal generated by the homogeneous elements of degree $d$ in $I$ has a linear…

Inspired by several recent papers on the edge ideal of a graph G, we study the equivalent notion of the independence complex of G. Using the tool of vertex decomposability from geometric combinatorics, we show that 5-chordal graphs with no…

Let $R=k[x_{1},\ldots,x_{n}]$, where $k$ is a field. The path ideal (of length $t\geq 2$) of a directed graph $G$ is the monomial ideal, denoted by $I_{t}(G)$, whose generators correspond to the directed paths of length $t$ in $G$. Let…

Monomial ideals corresponding to strong quasi-n-partite graphs are considered. Some algebraic and combinatorial properties of generalized graph ideals of a strong quasi-n-partite graph are studied. Furthermore, we show that the edge ideal…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field $K$, and let $A$ be a finitely generated standard graded $S$-algebra. We show that if the defining ideal of $A$ has a quadratic initial ideal, then all the graded components of…

Fr\"oberg's classical theorem about edge ideals with $2$-linear resolution can be regarded as a classification of graphs whose edge ideals have linearity defect zero. Extending his theorem, we classify all graphs whose edge ideals have…

We apply some basic notions from combinatorial topology to establish various algebraic properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we provide new short proofs of some theorems from the literature…

Associated to a simple undirected graph $G$ is a simplicial complex $\Delta_G$ whose faces correspond to the independent sets of $G$. A graph $G$ is called vertex decomposable if $\Delta_G$ is a vertex decomposable simplicial complex. We…

In this article, we study algebraic properties of binomial edge ideals of Levi graphs associated with certain plane curve arrangements. Using combinatorial properties of Levi graphs, we discuss the Cohen-Macaulayness of binomial edge ideals…

In this paper, we introduce and study families of squarefree monomial ideals called clique ideals and independence ideals that can be associated to a finite graph. A family of clique ideals with linear resolutions has been characterized.…

We study the licci property for several classes of squarefree monomial ideals arising from graphs and related combinatorial structures. We characterize licci bi-Cohen-Macaulay squarefree monomial ideals, complementary edge ideals, $t$-path…

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 $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 attempting to understand how combinatorial modifications alter algebraic properties of monomial ideals, several authors have investigated the process of adding "whiskers" to graphs. In this paper, we study a similar construction to build…

We describe the simplicial complex $\Delta$ such that the initial ideal of $J_G$ is the Stanley-Reisner ideal of $\Delta$. By $\Delta$ we show that if $J_G$ is $(S_2)$ then $G$ is accessible. We also characterize all accessible blocks with…

We recall a numerical criteria for Cohen--Macaulayness related to system of parameters, and introduce monomial ideals of K\"onig type which include the edge ideals of K\"onig graphs. We show that a monomial ideal is of K\"onig type if and…