A proof for a conjecture on the regularity of binomial edge ideals
From MaRDI portal
Publication:2229199
Abstract: In this paper we introduce the concept of clique disjoint edge sets in graphs. Then, for a graph , we define the invariant as the maximum size of a clique disjoint edge set in . We show that the regularity of the binomial edge ideal of is bounded above by . This, in particular, settles a conjecture on the regularity of binomial edge ideals in full generality.
Recommendations
- On the regularity of binomial edge ideals
- Regularity bounds for binomial edge ideals
- Binomial edge ideals and bounds for their regularity
- Regularity and \(h\)-polynomials of binomial edge ideals
- Regularity of parity binomial edge ideals
- The Castelnuovo-Mumford regularity of binomial edge ideals
- Regularity of powers of (parity) binomial edge ideals
- Binomial edge ideals: a survey
- A bound for the regularity of powers of edge ideals
- An upper bound for the regularity of binomial edge ideals of trees
Cites work
- Binomial edge ideals and conditional independence statements
- Binomial edge ideals of bipartite graphs
- Binomial edge ideals of graphs
- Binomial edge ideals of regularity 3
- Binomial edge ideals of small depth
- Binomial edge ideals with pure resolutions
- Cohen-Macaulay binomial edge ideals
- Depth and extremal Betti number of binomial edge ideals
- Graded syzygies
- Graph connectivity and binomial edge ideals
- Graphs and ideals generated by some 2-minors
- Licci binomial edge ideals
- Local cohomology of binomial edge ideals and their generic initial ideals
- On the binomial edge ideal of a pair of graphs
- On the regularity of binomial edge ideals
- Regularity bound of generalized binomial edge ideal of graphs
- Regularity bounds for binomial edge ideals
- Regularity of binomial edge ideals of Cohen-Macaulay bipartite graphs
- The Castelnuovo-Mumford regularity of binomial edge ideals
Cited in
(16)- Binomial edge ideals and bounds for their regularity
- Bound for the Regularity of Binomial Edge Ideals of Cactus Graphs
- Binomial edge ideals of cographs
- Linear strands of initial ideals of determinantal facet ideals
- Rees algebra and special fiber ring of binomial edge ideals of closed graphs
- On regularity of Rees algebras of edge ideals of cone graphs
- Regularity and \(h\)-polynomials of binomial edge ideals
- Cohen-Macaulay binomial edge ideals and accessible graphs
- Connected domination in graphs and \(v\)-numbers of binomial edge ideals
- The v-number of binomial edge ideals
- Regularity bounds for binomial edge ideals
- The Castelnuovo-Mumford regularity of binomial edge ideals
- Regularity of binomial edge ideals of Cohen-Macaulay bipartite graphs
- Closed binomial edge ideals
- On the depth of binomial edge ideals of graphs
- Binomial edge ideals of unicyclic graphs
This page was built for publication: A proof for a conjecture on the regularity of binomial edge ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229199)