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

DOI10.1142/S0219498819501706zbMath1498.13063arXiv1808.06374MaRDI QIDQ5231716

No author found.

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

treeCastelnuovo-Mumford regularityblock graphbinomial edge ideal

Mathematics Subject Classification ID

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

Related Items

Local cohomology of binomial edge ideals and their generic initial ideals ⋮ Regularity of powers of quadratic sequences with applications to binomial ideals ⋮ Krull dimension and regularity of binomial edge ideals of block graphs ⋮ Regularity of parity binomial edge ideals

Cites Work

• Regularity bounds for binomial edge ideals
• Binomial edge ideals of graphs
• The Castelnuovo-Mumford regularity of binomial edge ideals
• Binomial edge ideals and conditional independence statements
• Binomial edge ideals of bipartite graphs
• On the extremal Betti numbers of binomial edge ideals of block graphs
• Binomial edge ideals of regularity 3
• Regularity of binomial edge ideals of certain block graphs
• Graphs and Ideals Generated by Some 2-Minors
• Cohen-Macaulay binomial edge ideals
• Krull dimension and regularity of binomial edge ideals of block graphs
• On the binomial edge ideals of block graphs
• Construction of Cohen–Macaulay Binomial Edge Ideals