The Castelnuovo-Mumford regularity of binomial edge ideals
From MaRDI portal
Publication:899492
Abstract: We prove a conjectured upper bound for the Castelnuovo-Mumford regularity of binomial edge ideals of graphs, due to Matsuda and Murai. Indeed, we prove that for any graph with vertices, which is not a path. Moreover, we study the behavior of the regularity of binomial edge ideals under the join product of graphs.
Recommendations
Cites work
- Algebraic properties of the binomial edge ideal of a complete bipartite graph
- Binomial edge ideals and conditional independence statements
- Binomial edge ideals of graphs
- Binomial edge ideals with pure resolutions
- Cohen-Macaulay binomial edge ideals
- Extremal Betti numbers of some classes of binomial edge ideals
- Graded syzygies
- Graphs and ideals generated by some 2-minors
- Hilbert function of binomial edge ideals
- On the Betti numbers of some classes of binomial edge ideals
- On the binomial edge ideal of a pair of graphs
- On the regularity of binomial edge ideals
- Regularity bounds for binomial edge ideals
- Some Cohen-Macaulay and unmixed binomial edge ideals
Cited in
(46)- Regularity of powers of quadratic sequences with applications to binomial ideals
- Regularity and \(h\)-polynomials of binomial edge ideals
- Binomial edge ideals of unicyclic graphs
- The v-number of binomial edge ideals
- Regularity of the vanishing ideal over a bipartite nested ear decomposition
- Cohen-Macaulay binomial edge ideals and accessible graphs
- Regularity and projective dimension of edge ideals
- Binomial edge ideals and bounds for their regularity
- Binomial edge ideals with pure resolutions
- Licci binomial edge ideals
- The \(v\)-number and Castelnuovo-Mumford regularity of graphs
- On the regularity of binomial edge ideals
- Regularity of binomial edge ideals of Cohen-Macaulay bipartite graphs
- Level and pseudo-Gorenstein binomial edge ideals
- On the Betti numbers of some classes of binomial edge ideals
- Connected domination in graphs and \(v\)-numbers of binomial edge ideals
- Regularity of binomial edge ideals of certain block graphs
- Hankel edge ideals of trees and (semi-)Hamiltonian graphs
- Binomial edge ideals of cographs
- Regularity of parity binomial edge ideals
- Regularity bounds for binomial edge ideals
- On the extremal Betti numbers of binomial edge ideals of block graphs
- Matchings, coverings, and Castelnuovo-Mumford regularity
- An upper bound for the regularity of binomial edge ideals of trees
- Castelnuovo-Mumford regularity and initial ideals with no embedded prime ideals
- Closed binomial edge ideals
- Frobenius methods in combinatorics
- Binomial edge ideals of small depth
- Regularity of binomial edge ideals of chordal graphs
- Gorenstein binomial edge ideals
- Regularity of powers of binomial edge ideals of complete multipartite graphs
- Binomial edge ideals of regularity 3
- On the depth of binomial edge ideals of graphs
- Lovász-Saks-Schrijver ideals and coordinate sections of determinantal varieties
- Krull dimension and regularity of binomial edge ideals of block graphs
- Connectivity through bounds for the Castelnuovo-Mumford regularity
- Binomial edge ideals of generalized block graphs
- Regularity bound of generalized binomial edge ideal of graphs
- Joins, ears and Castelnuovo-Mumford regularity
- Lovász-Saks-Schrijver ideals and parity binomial edge ideals of graphs
- Regularity of the vanishing ideal over a parallel composition of paths
- Binomial edge ideals of bipartite graphs
- Almost complete intersection binomial edge ideals and their Rees algebras
- Bound for the Regularity of Binomial Edge Ideals of Cactus Graphs
- Castelnuovo-Mumford regularity of graphs
- A proof for a conjecture on the regularity of binomial edge ideals
This page was built for publication: The Castelnuovo-Mumford regularity of binomial edge ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899492)