Koszul Binomial Edge Ideal

• Koszul binomial edge ideal is a quadratic ideal associated with a finite graph that encodes key combinatorial properties affecting its algebraic structure.
• It characterizes Koszulness via conditions like strong chordality and claw-free configurations, ensuring a quadratic Gröbner basis under preferred orders.
• This concept underpins practical applications in combinatorial commutative algebra and algebraic statistics, facilitating computations of Betti numbers and regularity.

A Koszul binomial edge ideal is a quadratic ideal associated to a finite simple graph, whose algebraic and homological properties are intimately linked to the combinatorial structure of the underlying graph. The concept plays a central role in the study of the interplay between commutative algebra, combinatorics, and algebraic geometry, with deep connections to Gröbner bases, Koszul algebras, and forbidden subgraph characterizations.

1. Definition and Construction

Given a finite simple graph $G$ on the vertex set $[n] = \{1, 2, \dots, n\}$, consider the polynomial ring

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

over a field $K$, standard graded by $\deg x_i = \deg y_j = 1$. For each edge $\{i, j\}$ of $G$ with $i < j$, define the binomial generator

$f_{ij} = x_i y_j - x_j y_i \in S.$

The binomial edge ideal of $G$ is

$$J_G = (f_{ij} : \{i, j\} \in E(G),\; i < j) \subset S.$$

The quotient algebra $R_G = S/J_G$ is a quadratic commutative algebra generated in degree 1, whose Koszulness is governed by the combinatorics of $G$ (Crupi et al., 2010, LaClair et al., 21 Jan 2026, Ene et al., 2013).

2. Koszulness and Graph-Theoretic Criteria

An algebra $R = S/I$ is Koszul if the residue field $K = R/R_+$ has a linear free $R$-resolution; equivalently, the minimal resolution is generated entirely by linear entries. For binomial edge ideals, strict combinatorial conditions control Koszulness:

Characterization:

• $R_G$ is Koszul if and only if $G$ is strongly chordal and claw-free (LaClair et al., 21 Jan 2026).

Here,

• Chordal: No induced cycles of length $\ge 4$; admits a perfect elimination order.
• Strongly chordal: Chordal, and contains no induced "sun" (trampoline)—i.e., every induced subgraph has a vertex whose closed neighborhoods are totally ordered by inclusion.
• Claw-free: No induced subgraph isomorphic to $K_{1,3}$.

Earlier work established that Koszulness implies chordal and claw-free (Ene et al., 2013), but the full converse requires the strong chordality condition, since certain tent/nets yield Koszul rings without quadratic Gröbner bases (LaClair et al., 21 Jan 2026).

3. Closed Graphs and Quadratic Gröbner Bases

Closed graphs are a crucial subclass and admit a precise algebraic characterization:

• Closed (proper-interval) graphs: For some labelling, whenever $\{i, j\}, \{i, \ell\} \in E(G)$ with $i < j$, $i < \ell$, then $\{j, \ell\} \in E(G)$; similarly for "meeting at the larger endpoint" (Crupi et al., 2010, Ene et al., 2013).
• $G$ is closed $\Leftrightarrow$ $J_G$ has a quadratic Gröbner basis under some monomial order $\Leftrightarrow$ $R_G$ is Koszul (Crupi et al., 2010, Ene et al., 2013).
• Every closed graph is chordal and claw-free, but not all chordal claw-free graphs are closed.

Consequently, the existence of a quadratic Gröbner basis is both necessary and sufficient for Koszulness within the closed graph class, and closedness can be tested efficiently via lex-BFS (Crupi et al., 2010).

4. Gröbner Bases, Filtrations, and Homological Properties

• For closed graphs, the generators $f_{ij}$ form a quadratic Gröbner basis under a lexicographic order, so the initial ideal is generated by quadratic monomials.
• The maximal ideal of $R_G$ admits linear quotients in a specific variable order, characterizing closed graphs (Ene et al., 2013). Explicit Koszul filtrations can be constructed using intervals determined by neighborhoods, providing concrete control over Betti numbers and regularity.

In the general strongly chordal claw-free case, Koszulness can be shown by edge-deletion induction on so-called simplicial edges; the colon ideals and algebra retracts constructed ensure that regularity is preserved and modules have linear resolutions, ultimately forcing the Koszul property (LaClair et al., 21 Jan 2026).

5. Generalizations and Associated Structures

Ferrers-type Binomial Edge Ideals

Binomial edge ideals associated to skew Ferrers diagrams are formed for specific bipartite graphs arising from lattice diagrams:

• Sagbi basis techniques yield a quadratic Gröbner basis.
• The resulting algebras are Koszul, Cohen-Macaulay, and normal semigroup rings (Lin et al., 28 Aug 2025).
• Krull dimension is computed by enumerating perimeter cells.

Pairs of Graphs

For binomial edge ideals $J_{G_1,G_2}$ of pairs of graphs:

• $R_{G_1,G_2}$ is Koszul $\Leftrightarrow$ one graph is closed and the other is complete.
• This is equivalent to the existence of a quadratic Gröbner basis and to the maximal ideal admitting linear quotients in a prescribed order (Baskoroputro et al., 2017).

6. Homological and Dual Algebraic Properties

• The quadratic dual $R_G^{!}$ is explicitly constructed; its relations correspond to commutative, antisymmetric, and "mixing" terms derived from $G$ (Kivinen, 2014).
• Minimal resolutions features: $F_1 \cong R^{2n}$, $F_2 \cong R^{\binom{2n}{2} + |E|}$; first syzygies are always linear, distinguishing Koszulness at low degrees (Kivinen, 2014).

7. Examples, Applications, and Consequences

Examples:

• Complete graph $K_n$: $J_{K_n}$ corresponds to the ideal of $2 \times 2$ minors of the generic $2 \times n$ matrix; always closed and Koszul (Crupi et al., 2010).
• Path graph: Closed, quadratic Gröbner basis, Koszul.
• $4$-cycle or claw: Not chordal/claw-free; $J_G$ fails to be Koszul.

Applications: The theory underpins developments in algebraic statistics (conditional independence models), combinatorial commutative algebra, and explicit computations of algebraic invariants (Betti numbers, regularity, Hilbert functions).

Consequences:

• Strongly chordal claw-free graphs provide the comprehensive criterion for Koszul binomial edge ideals (LaClair et al., 21 Jan 2026).
• Closed graphs coincide with Koszulness in the quadratic Gröbner basis context, but there exist Koszul graphs without quadratic Gröbner bases (nets).
• Efficient recognition algorithms and explicit filtrations enable computational approaches for large graphs.

Open Directions: Complete structural descriptions for general strongly chordal claw-free graphs with large clique number, higher-dimensional clique complexes, and deep interactions with algebraic geometry and statistics remain active research fronts.