Regularity bounds for binomial edge ideals
From MaRDI portal
Publication:350810
Abstract: We show that the Castelnuovo-Mumford regularity of the binomial edge ideal of a graph is bounded below by the length of its longest induced path and bounded above by the number of its vertices.
Recommendations
Cited in
(52)- Joins, ears and Castelnuovo-Mumford regularity
- Regularity of the vanishing ideal over a parallel composition of paths
- Binomial edge ideals and bounds for their regularity
- On the Betti numbers of some classes of binomial edge ideals
- Maximal independent sets and regularity of graphs
- Bound for the Regularity of Binomial Edge Ideals of Cactus Graphs
- Lovász-Saks-Schrijver ideals and coordinate sections of determinantal varieties
- Binomial edge ideals of cographs
- On \(m\)-closed graphs
- Almost complete intersection binomial edge ideals and their Rees algebras
- Rees algebra and special fiber ring of binomial edge ideals of closed graphs
- Regularity and \(h\)-polynomials of binomial edge ideals
- Regularity of the vanishing ideal over a bipartite nested ear decomposition
- A proof for a conjecture on the regularity of binomial edge ideals
- An upper bound for the regularity of binomial edge ideals of trees
- Binomial Edge Ideals with Special Set of Associated Primes
- Regularity of parity binomial edge ideals
- Binomial edge ideals of generalized block graphs
- A bound for the regularity of powers of edge ideals
- Local cohomology of binomial edge ideals and their generic initial ideals
- Regularity of powers of quadratic sequences with applications to binomial ideals
- Cohen-Macaulay binomial edge ideals and accessible graphs
- Level and pseudo-Gorenstein binomial edge ideals
- Bounds on the regularity and projective dimension of ideals associated to graphs
- Regularity of binomial edge ideals of certain block graphs
- Connected domination in graphs and \(v\)-numbers of binomial edge ideals
- On the regularity of binomial edge ideals
- Binomial edge ideals with pure resolutions
- Lovász-Saks-Schrijver ideals and parity binomial edge ideals of graphs
- The v-number of binomial edge ideals
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
- Binomial edge ideals of bipartite graphs
- Licci binomial edge ideals
- Regularity bound of generalized binomial edge ideal of graphs
- Krull dimension and regularity of binomial edge ideals of block graphs
- The Castelnuovo-Mumford regularity of binomial edge ideals
- Regularity of binomial edge ideals of Cohen-Macaulay bipartite graphs
- Algebraic properties of binomial edge ideals of Levi graphs associated with curve arrangements
- Closed binomial edge ideals
- Gorenstein binomial edge ideals
- Bounds on the regularity of toric ideals of graphs
- Binomial edge ideals of regularity 3
- On the depth of binomial edge ideals of graphs
- On the extremal Betti numbers of binomial edge ideals of block graphs
- Regularity of powers of (parity) binomial edge ideals
- Binomial edge ideals of unicyclic graphs
- Binomial edge ideals of small depth
- Graph connectivity and binomial edge ideals
- Regularity of binomial edge ideals of chordal graphs
- Koszul binomial edge ideals
- Combinatorial bounds of the regularity of elimination ideals.
- COHEN-MACAULAY BINOMIAL EDGE IDEALS OF SOME CLASSES OF GRAPHS
This page was built for publication: Regularity bounds for binomial edge ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q350810)
