Some Cohen-Macaulay and unmixed binomial edge ideals
From MaRDI portal
(Redirected from Publication:3448586)
Abstract: 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 binomial edge ideals are Cohen-Macaulay and unmixed. So that we generalize the results of Ene, Herzog and Hibi on block graphs. Moreover, we study unmixedness and Cohen-Macaulayness of the binomial edge ideal of some graph products such as the join and corona of two graphs with respect to the original graphs'.
Recommendations
Cites work
- Binomial edge ideals and conditional independence statements
- Binomial edge ideals of complete multipartite graphs
- Binomial edge ideals with pure resolutions
- Cohen-Macaulay binomial edge ideals
- Graphs and ideals generated by some 2-minors
- On rigid circuit graphs
- On the binomial edge ideal of a pair of graphs
- The binomial edge ideal of a pair of graphs
Cited in
(33)- Binomial edge ideals of bipartite graphs
- Binomial edge ideals of regularity 3
- Regularity of binomial edge ideals of chordal graphs
- Hankel edge ideals of trees and (semi-)Hamiltonian graphs
- Cohen-Macaulay binomial edge ideals and accessible graphs
- Sequentially Cohen-Macaulay binomial edge ideals of closed graphs
- Binomial edge ideals of small depth
- Regularity of powers of (parity) binomial edge ideals
- \((S_2)\)-condition and Cohen-Macaulay binomial edge ideals
- Binomial edge ideals of complete multipartite graphs
- Unmixed Monomial Ideals of Dimension Two and Their Cohen–Macaulay Properties
- Hilbert series of binomial edge ideals
- Binomial edge ideals of unicyclic graphs
- Binomial edge ideals of generalized block graphs
- Cohen Macaulayness and arithmetical rank of generalized theta graphs
- Edge Ideals Using Macaulay2
- Cohen–Macaulay binomial edge ideals of cactus graphs
- Construction of Cohen-Macaulay binomial edge ideals
- Diameter and connectivity of finite simple graphs
- Cohen-Macaulay binomial edge ideals of small graphs
- Gorenstein binomial edge ideals
- Algebraic properties of binomial edge ideals of Levi graphs associated with curve arrangements
- Cohen-Macaulay property of binomial edge ideals with girth of graphs
- Generalized binomial edge ideals of bipartite graphs
- Binomial edge ideals of crown graphs
- On binomial edge ideals of corona of graphs
- Binomial edge ideals of trees
- Cohen-Macaulay binomial edge ideals in terms of blocks with whiskers
- A combinatorial characterization of S₂ binomial edge ideals
- Depth of binomial edge ideals in terms of diameter and vertex connectivity
- Castelnuovo-Mumford regularity of generalized binomial edge ideals of graphs
- Licci binomial edge ideals
- The Castelnuovo-Mumford regularity of binomial edge ideals
This page was built for publication: Some Cohen-Macaulay and unmixed binomial edge ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448586)