Construction of Cohen–Macaulay Binomial Edge Ideals

By Asia Rauf, Giancarlo Rinaldo. 2012

65 citations recorded by the source corpus.

We discuss algebraic and homological properties of binomial edge ideals associated with the graphs which are obtained by gluing of subgraphs and the formation of cones.

Subfields: Algebra and Number Theory, Computational Theory and Mathematics, Pharmacology

View Paper: https://www.semanticscholar.org/paper/652f192cefdd0a0dd69851b0850a3479e79fce4d

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

1. Sara Saeedi Madani
2. Dariush Kiani
3. Viviana Ene
4. Andrei Zarojanu

In Computational Theory and Mathematics

1. Sara Saeedi Madani
2. Dariush Kiani
3. Viviana Ene
4. Andrei Zarojanu

In Pharmacology

1. Sara Saeedi Madani
2. Dariush Kiani

Citations in the corpus

• Some Cohen–Macaulay and Unmixed Binomial Edge Ideals (2015, background): “ vertices [n1] and [n2], respectively. If n1 = n2 = 1, then H ⊙H′ is just an edge. If n1 = 1 and n2 ≥ 2, then H ⊙H′ is the cone of a vertex on the graph H′, which was studied in Section 4 and also in [10]. Now, we focus on the other cases. The following theorem determines those graphs whose binomial”
• On the regularity of binomial edge ideals (2013, background): “In the last years, many properties of binomial edge ideals have been studied in relation to the combinatorial data of the underlying graph and applications to statistics have been investigated; see [1], [3], [4, Chapter 6], [5], [7], [11], [12], [14], [16].”