Related papers: Monomial ideals of weighted oriented graphs

Let $\mathcal{D}$ be a weighted oriented graph and $I(\mathcal{D})$ be its edge ideal. In this paper, we show that all the symbolic and ordinary powers of $I(\mathcal{D})$ coincide when $\mathcal{D}$ is a weighted oriented certain class of…

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 article, we investigate the strongly robust property of toric ideals associated with weighted oriented graphs. We establish that the toric ideals of a broad class of monomial ideals are strongly robust; this class encompasses the…

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, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…

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…

We consider a class of graphs $G$ such that the height of the edge ideal $I(G)$ is half of the number $\sharp V(G)$ of the vertices. We give Cohen-Macaulay criteria for such graphs.

Let $G$ be a permutation graph. We show that $G$ is Cohen-Macaulay if and only if $G$ is unmixed and vertex decomposable. When this is the case, we obtain a combinatorial description for the $a$-invariant of $G$. Moreover, we characterize…

Let $G$ be a finite graph and $I(G)$ its edge ideal. We give a full description of the Stanley--Reisner complex of the polarization of $I(G)^2$, naturally introducing the tools of Stanley--Reisner theory in the study of the algebraic…

We graph-theoretically characterize triangle-free Gorenstein graphs $G$. As an application, we classify when $I(G)^2$ is Cohen-Macaulay.

In this paper, we first give some sufficient criteria for normality of monomial ideals. As applications, we show that closed neighborhood ideals of complete bipartite graphs are normal, and hence satisfy the (strong) persistence property.…

We consider the following properties of compact oriented irreducible graph-manifolds: to contain a $\pi_1$-injective surface (immersed, virtually embedded or embedded), be (virtually) fibered over $S^1$, and to carry a metric of nonpositive…

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…

We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of…

We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a…

Closed graphs have been characterized by Herzog et al. as the graphs whose binomial edge ideals have a quadratic Gr\"obner basis with respect to a diagonal term order. In this paper, we focus on a generalization of closed graphs, namely…

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 finite simple graph on a vertex set $V(G)=\{x_{11}, \ldots, x_{n1}\}$. Also let $m_1, \ldots,m_n \geq 2$ be integers and $G_1, \ldots, G_n$ be connected simple graphs on the vertex sets $V(G_i)=\{x_{i1}, \ldots, x_{im_i}\}$. In…

We classify all unicycle graphs whose edge-binomials form a $d$-sequence, particularly linear type binomial edge ideals. We also classify unicycle graphs whose parity edge-binomials form a $d$-sequence. We study the regularity of powers of…

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