Related papers: Cohen-Macaulay binomial edge ideals of small devia…
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.
This research focuses on analyzing the depth of generalized binomial edge ideals. We extend the notion of $d$-compatible map for the pairs of a complete graph and an arbitrary graph, and using it, we give a combinatorial lower bound for the…
We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…
Connected bipartite graphs whose binomial edge ideals are Cohen--Macaulay have been classified by Bolognini et al. In this paper, we compute the depth, Castelnuovo--Mumford regularity, and dimension of the generalized binomial edge ideals…
Let $\mathbf{CCM}$ denote the class of closed graphs with Cohen-Macaulay binomial edge ideals and $\mathbf{PIG}$ denote the class of proper interval graphs. Then $\mathbf{CCM}\subseteq \mathbf{PIG}$. The $\mathbf{PIG}$-completion problem is…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…
In this article, we characterize all unmixed and Cohen-Macaulay parity binomial edge ideals of cactus and chordal graphs in terms of the structural properties of the graph.
We present Binomials, a package for the computer algebra system Macaulay2, which specializes well known algorithms to binomial ideals. These come up frequently in algebraic statistics and commutative algebra, and it is shown that…
We compute the minimal primary decomposition for completely squarefree lexsegment ideals. We show that critical squarefree monomial ideals are sequentially Cohen-Macaulay. As an application, we give a complete characterization of the…
We characterize unmixed and Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs. We also provide examples of oriented graphs which have unmixed and non-Cohen-Macaulay vertex-weighted edge ideals, while the edge ideal of…
We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…
We associate a {\it skew tableau ideal} to each filling of a skew Ferrers diagram with positive integers. We classify all unmixed and sequentially Cohen-Macaulay skew tableau ideals. Consequently, we classify all Cohen-Macaulay, Buchsbaum,…
We first characterise graphs with binomial edge ideals of K\"onig type as those for which the path covering number is equal to a minor variant of the scattering number. These are well-studied graph-theoretic invariants, allowing us to apply…
Let $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$ and let $I$ be a monomial ideal of $R$. In this paper, we present an explicit formula for the Betti numbers of almost complete intersection monomial ideals,…
Let $\mathcal{D}$ be a weighted oriented graph and let $I(\mathcal{D})$ be its edge ideal. Under a natural condition that the underlying (undirected) graph of $\mathcal{D}$ contains a perfect matching consisting of leaves, we provide…
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…
In the present paper, we aim to classify monomial ideals whose all matching powers are Cohen-Macaulay. We especially focus our attention on edge ideals. The Cohen-Macaulayness of the last matching power of an edge ideal is characterized,…
We describe combinatorially the Cohen-Macaulay type of edge-weighted r-path suspensions of edge-weighted graphs for an arbitrary positive integer r. The computation of the Cohen-Macaulay type of edge-weighted suspensions of edge-weighted…
We provide a Hochster type formula for the local cohomology modules of binomial edge ideals. As a consequence we obtain a simple criterion for the Cohen-Macaulayness of these ideals and we describe their Castelnuovo-Mumford regularity and…
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…