An upper bound for the regularity of binomial edge ideals of trees

DOI10.1142/S0219498819501706MaRDI QIDQ5231716zbMATH OpenWikidataFDO

Authors

Publication date 27 August 2019

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.06374

zbMATH Keywords

binomial edge idealblock graphCastelnuovo-Mumford regularitytree

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Syzygies, resolutions, complexes and commutative rings (13D02) Commutative rings defined by binomial ideals, toric rings, etc. (13F65)

Abstract: In this article we obtain an improved 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
• Cohen-Macaulay binomial edge ideals
• Construction of Cohen-Macaulay binomial edge ideals
• Graphs and ideals generated by some 2-minors
• Krull dimension and regularity of binomial edge ideals of block graphs
• On the binomial edge ideals of block graphs
• On the extremal Betti numbers of binomial edge ideals of block graphs
• Regularity bounds for binomial edge ideals
• Regularity of binomial edge ideals of certain block graphs
• The Castelnuovo-Mumford regularity of binomial edge ideals

Cited in

(6)

• Local cohomology of binomial edge ideals and their generic initial ideals
• Regularity of powers of quadratic sequences with applications to binomial ideals
• A proof for a conjecture on the regularity of binomial edge ideals
• Krull dimension and regularity of binomial edge ideals of block graphs
• Regularity of parity binomial edge ideals
• The v-number of binomial edge ideals

This page was built for publication: An upper bound for the regularity of binomial edge ideals of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5231716)