Related papers: Cohen-Macaulay binomial edge ideals of cactus grap…
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 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 provide a full combinatorial characterization of sequentially Cohen-Macaulay binomial edge ideals of closed graphs. In addition, we show that a binomial edge ideal of a closed graph is approximately Cohen-Macaulay if and…
We provide the regularity and the Cohen-Macaulay type of binomial edge ideals of Cohen-Macaulay cones, and we show the extremal Betti numbers of some classes of Cohen-Macaulay binomial edge ideals: Cohen-Macaulay bipartite and fan graphs.…
We prove that 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.
We classify all binomial edge ideals that are complete intersection and Cohen-Macaulay almost complete intersection. We also describe an algorithm and provide an implementation to compute primary decomposition of binomial edge ideals.
In this article, we obtain an upper bound for the regularity of the binomial edge ideal of a graph whose every block is either a cycle or a clique. As a consequence, we obtain an upper bound for the regularity of binomial edge ideal of a…
We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes. The bound is sharp, but in many cases it can be improved.…
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.
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…
We classify the bipartite graphs $G$ whose binomial edge ideal $J_G$ is Cohen-Macaulay. The connected components of such graphs can be obtained by gluing a finite number of basic blocks with two operations. In this context we prove the…
Let $G$ be a simple graph on $n$ vertices and let $J_{G,m}$ be the generalized binomial edge ideal associated to $G$ in the polynomial ring $K[x_{ij}, 1\le i \le m, 1\le j \le n]$. We classify the Cohen-Macaulay generalized binomial edge…
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 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.
We study unmixed and Cohen-Macaulay properties of the binomial edge ideal of some classes of graphs. We compute the depth of the binomial edge ideal of a generalized block graph. We also characterize all generalized block graphs whose…
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…
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…
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…
We study weighted graphs and their "edge ideals" which are ideals in polynomial rings that are defined in terms of the graphs. We provide combinatorial descriptions of m-irreducible decompositions for the edge ideal of a weighted graph in…
We classify all graphs $G$ satisfying the property that all matching powers $I(G)^{[k]}$ of the edge ideal $I(G)$ are bi-Cohen-Macaulay for $1\le k\le\nu(G)$, where $\nu(G)$ is the maximum size of a matching of $G$.