Binomial Edge Ideals Overview

• Binomial edge ideals are quadratic binomial ideals defined from a graph’s edges via the 2×2 minors of a generic 2×n matrix, bridging the gap between edge ideals and determinantal ideals.
• Gröbner theory, linkage, and cut-set analysis are key methodologies that establish radicality and characterize depth properties such as Cohen–Macaulayness in these ideals.
• Applications include classifying special graph classes (e.g., closed and weakly closed graphs) and precisely analyzing algebraic invariants like Betti numbers, regularity, and projective dimensions.

A binomial edge ideal is the quadratic binomial ideal attached to a simple graph $G$ on $[n]=\{1,\dots,n\}$, defined in the polynomial ring

$S=K[x_1,\dots,x_n,y_1,\dots,y_n]$

by

$$J_G=\bigl(x_i y_j-x_j y_i:\{i,j\}\in E(G),\ i<j\bigr).$$

Its generators are the $2\times 2$ minors of the generic $2\times n$ matrix

$$\begin{pmatrix} x_1 & x_2 & \cdots & x_n\ y_1 & y_2 & \cdots & y_n \end{pmatrix},$$

restricted to the edge set of $G$. The subject lies at the interface of determinantal algebra, Gröbner theory, combinatorics of cut sets and clique complexes, and homological methods. The classical theory has also become the $m=2$ case of several broader constructions, including generalized binomial edge ideals and ideals attached to a pair of graphs [(Ene et al., 2020); (Rauh, 2012); (Ene et al., 2012)].

1. Determinantal origin and basic structure

The determinantal viewpoint is built into the definition. When $G=K_n$, the ideal $[n]=\{1,\dots,n\}$0 is the full ideal of $[n]=\{1,\dots,n\}$1-minors of the generic $[n]=\{1,\dots,n\}$2 matrix, so binomial edge ideals interpolate between edge ideals of graphs and classical determinantal ideals. This positioning explains why techniques from Gröbner bases, Rees algebras, linkage, and Frobenius methods all enter the theory.

A central foundational fact is that binomial edge ideals are radical. This is already visible from their Gröbner-theoretic behavior: for suitable term orders, their initial ideals are squarefree monomial ideals. The radicality statement extends naturally to Rauh’s generalized binomial edge ideals. If $[n]=\{1,\dots,n\}$3 is a finite label set of size $[n]=\{1,\dots,n\}$4, $[n]=\{1,\dots,n\}$5 is the vertex set of a graph, and

$[n]=\{1,\dots,n\}$6

then the generalized binomial edge ideal is

$[n]=\{1,\dots,n\}$7

For $[n]=\{1,\dots,n\}$8, this recovers the classical binomial edge ideal. The generalized setting retains radicality and admits an explicit path-indexed Gröbner basis (Rauh, 2012).

A further enlargement is the binomial edge ideal of a pair of graphs. If $[n]=\{1,\dots,n\}$9 is on $S=K[x_1,\dots,x_n,y_1,\dots,y_n]$0, $S=K[x_1,\dots,x_n,y_1,\dots,y_n]$1 is on $S=K[x_1,\dots,x_n,y_1,\dots,y_n]$2, and $S=K[x_1,\dots,x_n,y_1,\dots,y_n]$3 is an $S=K[x_1,\dots,x_n,y_1,\dots,y_n]$4 matrix of indeterminates, then

$S=K[x_1,\dots,x_n,y_1,\dots,y_n]$5

where $S=K[x_1,\dots,x_n,y_1,\dots,y_n]$6 is the $S=K[x_1,\dots,x_n,y_1,\dots,y_n]$7-minor associated to the edge pair $S=K[x_1,\dots,x_n,y_1,\dots,y_n]$8. This framework simultaneously contains classical binomial edge ideals, generalized binomial edge ideals, and ideals of adjacent minors (Ene et al., 2012).

2. Minimal primes, cut sets, and geometry

The minimal-prime theory of $S=K[x_1,\dots,x_n,y_1,\dots,y_n]$9 is governed by vertex deletion. For a subset $$J_G=\bigl(x_i y_j-x_j y_i:\{i,j\}\in E(G),\ i<j\bigr).$$0, let $$J_G=\bigl(x_i y_j-x_j y_i:\{i,j\}\in E(G),\ i<j\bigr).$$1 have connected components $$J_G=\bigl(x_i y_j-x_j y_i:\{i,j\}\in E(G),\ i<j\bigr).$$2, and let $$J_G=\bigl(x_i y_j-x_j y_i:\{i,j\}\in E(G),\ i<j\bigr).$$3 denote the complete graph on the vertex set of $$J_G=\bigl(x_i y_j-x_j y_i:\{i,j\}\in E(G),\ i<j\bigr).$$4. Then the associated prime is

$$J_G=\bigl(x_i y_j-x_j y_i:\{i,j\}\in E(G),\ i<j\bigr).$$5

The ideal $$J_G=\bigl(x_i y_j-x_j y_i:\{i,j\}\in E(G),\ i<j\bigr).$$6 is the intersection of such primes, and $$J_G=\bigl(x_i y_j-x_j y_i:\{i,j\}\in E(G),\ i<j\bigr).$$7 is minimal exactly when $$J_G=\bigl(x_i y_j-x_j y_i:\{i,j\}\in E(G),\ i<j\bigr).$$8 is a cut-point set, equivalently a cut set in the sense that every vertex of $$J_G=\bigl(x_i y_j-x_j y_i:\{i,j\}\in E(G),\ i<j\bigr).$$9 is essential for the induced disconnection. For connected $2\times 2$0,

$2\times 2$1

This dictionary between minimal primes and cut sets is one of the basic structural features of the subject (Ene et al., 2020, Malayeri et al., 2020).

Unmixedness is encoded numerically by the same combinatorics. For connected $2\times 2$2, the standard criterion is

$2\times 2$3

This condition recurs throughout the literature because it is the entry point for Cohen–Macaulayness, Serre conditions, and dual-graph connectedness arguments [(Rauf et al., 2012); (Bolognini et al., 2023)].

The geometric decomposition has an especially transparent form for generalized binomial edge ideals. Writing a point of the ambient affine space as a matrix whose columns are $2\times 2$4, the defining equations impose proportionality of columns along edges. For any subset $2\times 2$5, one considers the locus $2\times 2$6 where columns outside $2\times 2$7 vanish and columns within the same connected component of $2\times 2$8 are proportional. Then

$2\times 2$9

each $2\times n$0 is the variety of a prime ideal $2\times n$1, and the irreducible components are rational. This gives a geometric counterpart to the combinatorial primary decomposition (Rauh, 2012).

The same cut-set combinatorics also controls the generic initial ideal. For the $2\times n$2-graded generic initial ideal of $2\times n$3, the minimal primes are indexed by pairs $2\times n$4, where $2\times n$5 is a cut set and $2\times n$6 is a transversal of $2\times n$7. This description is central in the combinatorial analysis of Serre’s condition $2\times n$8 (Bolognini et al., 2023).

3. Gröbner bases, admissible paths, and special graph classes

Gröbner theory for binomial edge ideals is path-theoretic. For the classical ideal $2\times n$9, the reduced Gröbner basis with respect to the lexicographic order

$$\begin{pmatrix} x_1 & x_2 & \cdots & x_n\ y_1 & y_2 & \cdots & y_n \end{pmatrix},$$0

is indexed by admissible paths $$\begin{pmatrix} x_1 & x_2 & \cdots & x_n\ y_1 & y_2 & \cdots & y_n \end{pmatrix},$$1, together with monomials $$\begin{pmatrix} x_1 & x_2 & \cdots & x_n\ y_1 & y_2 & \cdots & y_n \end{pmatrix},$$2, and consists of the elements

$$\begin{pmatrix} x_1 & x_2 & \cdots & x_n\ y_1 & y_2 & \cdots & y_n \end{pmatrix},$$3

A standard consequence is that $$\begin{pmatrix} x_1 & x_2 & \cdots & x_n\ y_1 & y_2 & \cdots & y_n \end{pmatrix},$$4 is squarefree, hence $$\begin{pmatrix} x_1 & x_2 & \cdots & x_n\ y_1 & y_2 & \cdots & y_n \end{pmatrix},$$5 is radical [(Chaudhry et al., 2014); (Kivinen, 2014)].

The generalized theory has a parallel but უფრო elaborate path combinatorics. There the reduced Gröbner basis is indexed by admissible paths together with strictly $$\begin{pmatrix} x_1 & x_2 & \cdots & x_n\ y_1 & y_2 & \cdots & y_n \end{pmatrix},$$6-antitone labelings $$\begin{pmatrix} x_1 & x_2 & \cdots & x_n\ y_1 & y_2 & \cdots & y_n \end{pmatrix},$$7, and the basis elements are

$$\begin{pmatrix} x_1 & x_2 & \cdots & x_n\ y_1 & y_2 & \cdots & y_n \end{pmatrix},$$8

Their initial monomials are squarefree, which again yields radicality (Rauh, 2012).

A decisive graph class is the class of closed graphs. A graph is closed if it admits a labeling for which the natural generators of $$\begin{pmatrix} x_1 & x_2 & \cdots & x_n\ y_1 & y_2 & \cdots & y_n \end{pmatrix},$$9 form a quadratic Gröbner basis with respect to lex order. For such graphs,

$G$0

which is the edge ideal of a bipartite graph. Closed graphs therefore occupy a privileged position at the intersection of quadratic Gröbner theory, normal torsion-freeness of initial ideals, and explicit Betti calculations (Ene et al., 2020, Seccia, 2022).

Weakly closed graphs form a broader class. They are precisely the co-comparability graphs, and they admit an algebraic characterization in terms of Knutson ideals for a specific polynomial

$G$1

More precisely, after a suitable labeling,

$G$2

This places weakly closed graphs between the quadratic Gröbner-basis world of closed graphs and the positive-characteristic theory of $G$3-purity (Seccia, 2022).

4. Unmixedness, Cohen–Macaulayness, and Serre-type conditions

A large part of the theory asks when graph-theoretic constraints force strong depth properties. One basic mechanism is gluing along a free vertex. If $G$4 with $G$5 and $G$6 free in both clique complexes, then

$G$7

and

$G$8

This extends to tree-like gluings of several graphs and yields a construction toolkit for Cohen–Macaulay binomial edge ideals (Rauf et al., 2012).

The cone construction behaves differently. If $G$9 with $m=2$0 connected and $m=2$1 unmixed, then $m=2$2 is unmixed if and only if $m=2$3 is complete; if this holds, then $m=2$4 is Cohen–Macaulay. For a cone over two connected components, unmixedness is equivalent to unmixedness of both components, and Cohen–Macaulayness follows when both components are Cohen–Macaulay (Rauf et al., 2012).

For bipartite graphs there is a full classification. The connected bipartite graphs whose binomial edge ideals are Cohen–Macaulay are exactly those obtained from the basic blocks $m=2$5 by the gluing operations $m=2$6 and $m=2$7. In this class, the connectedness of the dual graph is equivalent to Cohen–Macaulayness, giving a converse to Hartshorne’s connectedness theorem for connected bipartite binomial edge ideals (Bolognini et al., 2017).

Serre’s condition $m=2$8 also has a purely graph-theoretic formulation. A graph $m=2$9 is called accessible when $G=K_n$0 is unmixed and the family of cut sets forms an accessible set system. The main theorem in this direction is

$G=K_n$1

A key intermediate fact is that, for unmixed binomial edge ideals, accessibility of the cut-set family is equivalent to strong accessibility (Bolognini et al., 2023).

At the lower end of the depth spectrum, the poset-topological approach gives a sharp classification: $G=K_n$2 for some graph $G=K_n$3, provided $G=K_n$4. More generally, if $G=K_n$5 has at least three vertices, then $G=K_n$6 (Malayeri et al., 2020).

5. Regularity, Betti theory, projective dimension, and linkage

The homological profile of $G=K_n$7 reflects graph structure with unusual precision. A fundamental classification says that, for a graph $G=K_n$8 with no isolated vertices,

$G=K_n$9

The same work introduced free cut edge switching, an operation preserving all graded Betti numbers, and hence preserving projective dimension and regularity (Kiani et al., 2014).

For block graphs, depth and regularity admit especially explicit descriptions. If $[n]=\{1,\dots,n\}$00 is a block graph with $[n]=\{1,\dots,n\}$01 connected components, then

$[n]=\{1,\dots,n\}$02

For the subclass of $[n]=\{1,\dots,n\}$03-graphs,

$[n]=\{1,\dots,n\}$04

As a consequence, for a tree $[n]=\{1,\dots,n\}$05 with longest induced path of length $[n]=\{1,\dots,n\}$06,

$[n]=\{1,\dots,n\}$07

These statements link extremal regularity directly to clique-chain structure (Chaudhry et al., 2014).

For generalized block graphs, the number $[n]=\{1,\dots,n\}$08 of minimal cut sets enters the last Betti corner. If $[n]=\{1,\dots,n\}$09 is connected and indecomposable, then

$[n]=\{1,\dots,n\}$10

is an extremal Betti number, so $[n]=\{1,\dots,n\}$11. Moreover, $[n]=\{1,\dots,n\}$12 has a unique extremal Betti number exactly when no induced flower graph $[n]=\{1,\dots,n\}$13 with $[n]=\{1,\dots,n\}$14 occurs; in that case

$[n]=\{1,\dots,n\}$15

This gives a sharp obstruction theory for the Betti table of generalized block graphs (Kumar, 2019).

Projective dimension can also be controlled combinatorially in specific families. For the cycle $[n]=\{1,\dots,n\}$16 with $[n]=\{1,\dots,n\}$17,

$[n]=\{1,\dots,n\}$18

while for the crown graph $[n]=\{1,\dots,n\}$19,

$[n]=\{1,\dots,n\}$20

For complete multipartite graphs $[n]=\{1,\dots,n\}$21, the equality $[n]=\{1,\dots,n\}$22 holds exactly when $[n]=\{1,\dots,n\}$23 (Kumar et al., 5 Jul 2025).

Linkage imposes an even stronger rigidity. For a connected graph $[n]=\{1,\dots,n\}$24, $[n]=\{1,\dots,n\}$25 is licci if and only if $[n]=\{1,\dots,n\}$26 is either a path graph or a triangle with possibly some paths attached to some of its vertices. In the chordal case, the Cohen–Macaulay hypothesis in this criterion can be weakened to unmixedness (Ene et al., 2019).

6. Koszulness and positive-characteristic properties

Because $[n]=\{1,\dots,n\}$27 is always generated by quadrics, Koszulness has long been a central question. Earlier work established the implication

$[n]=\{1,\dots,n\}$28

showed that gluing along a free vertex preserves Koszulness, characterized cone graphs by

$[n]=\{1,\dots,n\}$29

and computed the quadratic dual of $[n]=\{1,\dots,n\}$30 explicitly. The first two Betti numbers in the minimal free resolution of the residue field over $[n]=\{1,\dots,n\}$31 are

$[n]=\{1,\dots,n\}$32

and these first two syzygies are always linear (Kivinen, 2014).

A complete graph-theoretic classification is now known: $[n]=\{1,\dots,n\}$33 Equivalently, $[n]=\{1,\dots,n\}$34 is Koszul if and only if $[n]=\{1,\dots,n\}$35 is chordal, claw-free, and tent-free. This shows that Koszulness is strictly weaker than having a quadratic Gröbner basis; closed graphs form a proper subclass, and the net is the smallest obstruction separating the two notions (LaClair et al., 21 Jan 2026).

In positive characteristic, weakly closed graphs are a natural sufficient class for $[n]=\{1,\dots,n\}$36-purity. Indeed, if $[n]=\{1,\dots,n\}$37 is weakly closed, then $[n]=\{1,\dots,n\}$38 is $[n]=\{1,\dots,n\}$39-pure in positive characteristic; the same extension holds for generalized binomial edge ideals (Seccia, 2022).

More recently, Matsuda’s characteristic-$[n]=\{1,\dots,n\}$40 conjecture was resolved: $[n]=\{1,\dots,n\}$41 At the same time, the “eventual $[n]=\{1,\dots,n\}$42-purity” conjecture was disproved in a strong form: if $[n]=\{1,\dots,n\}$43 contains an asteroidal triple, then $[n]=\{1,\dots,n\}$44 is not $[n]=\{1,\dots,n\}$45-pure in any positive characteristic. For chordal graphs, $[n]=\{1,\dots,n\}$46-purity in all characteristics, $[n]=\{1,\dots,n\}$47-purity in some positive characteristic, AT-freeness, and weak closedness are equivalent. The same work also notes that every $[n]=\{1,\dots,n\}$48 is $[n]=\{1,\dots,n\}$49-injective because $[n]=\{1,\dots,n\}$50 has a squarefree initial ideal for suitable term orders (LaClair et al., 21 Jan 2026).

7. Powers, symbolic powers, and major generalizations

The symbolic-power problem asks when

$[n]=\{1,\dots,n\}$51

For a homogeneous ideal with squarefree initial ideal, a transfer principle can relate symbolic powers of the ideal to those of its initial ideal. Applied to binomial edge ideals, this yields the theorem that if $[n]=\{1,\dots,n\}$52 is connected and $[n]=\{1,\dots,n\}$53 is normally torsion-free, then

$[n]=\{1,\dots,n\}$54

Since closed graphs have

$[n]=\{1,\dots,n\}$55

the edge ideal of a bipartite graph, one obtains

$[n]=\{1,\dots,n\}$56

The same analysis exhibits both a positive and a negative boundary case: for $[n]=\{1,\dots,n\}$57, the equality holds for all $[n]=\{1,\dots,n\}$58; for $[n]=\{1,\dots,n\}$59, the initial ideal is not normally torsion-free because $[n]=\{1,\dots,n\}$60, even though $[n]=\{1,\dots,n\}$61 still holds (Ene et al., 2020).

The homology of powers has also begun to stabilize in explicit closed forms. If $[n]=\{1,\dots,n\}$62 is closed and $[n]=\{1,\dots,n\}$63-free, with $[n]=\{1,\dots,n\}$64 and $[n]=\{1,\dots,n\}$65 the number of triangles, then for every $[n]=\{1,\dots,n\}$66 and $[n]=\{1,\dots,n\}$67,

$[n]=\{1,\dots,n\}$68

Thus the entire $[n]=\{1,\dots,n\}$69-linear strand of each power depends only on $[n]=\{1,\dots,n\}$70, $[n]=\{1,\dots,n\}$71, and $[n]=\{1,\dots,n\}$72, and agrees with that of the lexicographic initial ideal (Dohadwala et al., 15 Jan 2026).

Among higher-row analogues, generalized binomial edge ideals have recently been shown to be Cartwright–Sturmfels for all $[n]=\{1,\dots,n\}$73. If $[n]=\{1,\dots,n\}$74 denotes the ideal of $[n]=\{1,\dots,n\}$75-minors in the columns indexed by the edges of $[n]=\{1,\dots,n\}$76, then $[n]=\{1,\dots,n\}$77 is Cartwright–Sturmfels, and its $[n]=\{1,\dots,n\}$78-graded generic initial ideal is generated by monomials

$[n]=\{1,\dots,n\}$79

where $[n]=\{1,\dots,n\}$80 is connected and

$[n]=\{1,\dots,n\}$81

This places generalized binomial edge ideals inside a very rigid multigraded class and sharpens the older radicality theorem (Conca et al., 26 Dec 2025).

Two other related families show how special the classical theory is. For ideals $[n]=\{1,\dots,n\}$82 attached to a pair of graphs, radicality is equivalent to one of the graphs being complete, and a quadratic Gröbner basis occurs exactly when one graph is complete and the other is closed (Ene et al., 2012). For parity binomial edge ideals,

$[n]=\{1,\dots,n\}$83

the Gröbner basis is generally not squarefree, and

$[n]=\{1,\dots,n\}$84

On bipartite graphs, however, parity and classical binomial edge ideals coincide up to a variable swap, which clarifies both the analogy and the divergence between the two theories (Kahle et al., 2015).