---
title: Gorenstein Planar Ternary Graphs
url: https://www.emergentmind.com/topics/gorenstein-planar-ternary-graphs
type: topic
---

# Gorenstein Planar Ternary Graphs

Gorenstein planar ternary graphs are studied through the Stanley–Reisner algebra of edge ideals and the topology of independence complexes. In the recent independence-complex literature, a ternary graph is a finite simple graph with no induced cycle whose length is divisible by \(3\), while a graph \(G\) is Gorenstein when \(R/I(G)\) is Gorenstein, equivalently when its independence complex \(\Ind(G)=\Delta(G)\) is Gorenstein [2508.00699][1603.00326]. The subject links exact planar criteria, triangle-free and girth-restricted graph classifications, and a planar-ternary theory in which spherical independence complexes become vertex decomposable flag spheres with explicit combinatorial and enumerative structure [1508.07713][2509.21705].

## 1. Foundational definitions and terminological scope

For a simple graph \(G\) on vertices \(\{x_1,\dots,x_n\}\), the edge ideal is
\[
I(G)=(x_ix_j\mid x_ix_j\in E(G))\subseteq R=k[x_1,\dots,x_n],
\]
and the independence complex \(\Delta(G)=\Ind(G)\) has as faces the independent sets of \(G\). Its dimension is
\[
\dim \Delta(G)=\alpha(G)-1,
\]
where \(\alpha(G)\) is the independence number [1508.07713]. In this framework, \(G\) is Cohen–Macaulay or Gorenstein precisely when \(R/I(G)\), equivalently \(\Delta(G)\), has the corresponding property [1603.00326].

Two auxiliary notions recur throughout the literature. A graph is well-covered if every maximal independent set has the same size. The class \(W_2\) consists of graphs \(G\) that are well-covered and satisfy
\[
G\setminus x \text{ is well-covered and } \alpha(G\setminus x)=\alpha(G)
\]
for every vertex \(x\) [1508.07713]. For an independent set \(S\), the localization
\[
G_S=G\setminus (S\cup N_G(S))
\]
satisfies
\[
\Delta(G_S)=\lk_{\Delta(G)}(S),
\]
which is the main graph-theoretic mechanism for inductive link calculations [1603.00326].

The modern planar-ternary literature uses ternary to mean that \(G\) has no induced cycle whose length is \(0\bmod 3\), and \((0,1)\)-ternary to mean that \(G\) has no induced cycles of length \(0\) or \(1\bmod 3\) [2508.00699]. Adjacent papers note other uses of related language: one girth-based classification treats “ternary/subcubic” only as an external interpretation, and the graphic-matroid literature remarks that ternary representability is not part of its explicit Gorenstein classification [1204.5561][1905.05418]. As a result, the phrase *Gorenstein planar ternary graphs* is technically meaningful only after the operative notion of ternaryness has been fixed.

## 2. Planar Gorenstein graphs and the Eulerian criterion

The central planar recognition theorem is that a planar graph is Gorenstein if and only if its independence complex is Eulerian [1603.00326]. The paper proves the more general statement that if \(G\) is a pseudo-planar graph without isolated vertices, then
\[
G \text{ is Gorenstein } \Longleftrightarrow \Delta(G)\text{ is Eulerian},
\]
and every planar graph is pseudo-planar [1603.00326]. For planar graphs, Gorensteinness is therefore converted from a ring-theoretic condition on \(R/I(G)\) into a combinatorial-topological condition on \(\Delta(G)\).

The proof uses a local-to-global strategy. If \(\Delta(G)\) is Eulerian, then it is semi-Eulerian, and this implies \(G\in W_2\) [1603.00326]. A key identity expresses the reduced Euler characteristic of \(\Delta(G)\) in terms of a neighborhood graph:
\[
(\Delta(G)) = (-1)^d\bigl(1+(\Delta(G[N(v)]))\bigr),
\]
where \(d=\dim\Delta(G)\) [1603.00326]. Hence
\[
\Delta(G)\text{ is Eulerian} \iff (\Delta(G[N(v)]))=0
\]
for every, equivalently for some, vertex \(v\) [1603.00326]. The remaining difficulty is Cohen–Macaulayness; the proof resolves it via chain-level reductions on localizations \(G_S\), Reisner’s criterion for vanishing link homology, and Stanley’s criterion that a simplicial complex is Gorenstein iff its core is Cohen–Macaulay and Eulerian [1603.00326].

This characterization is especially important because general Gorensteinness of graphs can depend on the characteristic of the base field, whereas the planar theorem isolates a purely combinatorial criterion in the planar setting [1508.07713][1603.00326].

## 3. Triangle-free, girth-restricted, and recursively generated planar families

For triangle-free graphs, the Gorenstein property becomes purely combinatorial. The basic theorem states that if \(G\) is a simple graph without isolated vertices, then the following are equivalent:
\[
\text{\(G\) is triangle-free Gorenstein,}
\]
\[
\text{\(G\) is a triangle-free member of }W_2,
\]
\[
I(G)^2 \text{ is Cohen–Macaulay}
\]
[1508.07713]. In this regime, Gorensteinness is controlled by well-coveredness together with the vertex-deletion stability encoded in \(W_2\). The same paper gives an edge-local reformulation: for a triangle-free graph without isolated vertices,
\[
G\in W_2 \iff \text{for every edge }ab,\; G_{ab}\text{ is well-covered and } \alpha(G_{ab})=\alpha(G)-1,
\]
where
\[
G_{ab}=G\setminus (N_G(a)\cup N_G(b))
\]
[1508.07713]. This criterion is what allows the equivalence with Cohen–Macaulayness of \(I(G)^2\).

The planar girth-\(4\) case is completely explicit. Using Pinter’s classification of connected planar \(W_2\)-graphs of girth \(4\), one obtains a family \(\{G_n\}_{n\ge 3}\) that exhausts the connected planar Gorenstein graphs of girth \(4\) [1508.07713]. In a parallel formulation, a connected planar graph of girth \(4\) is Gorenstein if and only if it lies in the recursive family \(\mathcal G\), equivalently if and only if it is isomorphic to \(G_n\) for some \(n\ge 3\) [1204.5561]. The recursive construction starts from \(G_3\); given adjacent degree-\(2\) vertices \(x,y\), if \(u\) is the other neighbor of \(x\), then one adds vertices \(a,b,c\) and edges
\[
a\!-\!x,\quad a\!-\!b,\quad b\!-\!c,\quad c\!-\!u,\quad c\!-\!y
\]
to obtain the next graph in the family [1204.5561].

These graphs are structurally rigid. For all \(n\ge 1\), both \(G_n\) and \(H_n=G_n\setminus x_{3n-1}\) are well-covered and vertex decomposable, with
\[
\alpha(G_n)=\alpha(H_n)=n,
\]
hence Cohen–Macaulay [1204.5561]. Moreover,
\[
I(G_n)^2 \text{ is Cohen–Macaulay}
\]
for all \(n\ge 1\) [1204.5561]. The triangle-free classification also implies that for connected graphs in \(W_2\), if the graph is not \(K_2\) or \(C_5\), then its girth is at most \(4\); thus the connected Gorenstein graphs of girth at least \(5\) are only \(K_1\), \(K_2\), and \(C_5\) [1508.07713].

## 4. Ternary graphs and spherical independence complexes

The ternary condition imposes a strong homotopical dichotomy. Kim’s theorem, as quoted in the planar-ternary literature, states that
\[
G \text{ is ternary } \iff \text{ every induced subgraph of }G\text{ has independence complex contractible or homotopy equivalent to a sphere}
\]
[2509.21705]. Thus ternaryness is detected by the topology of all induced-subgraph independence complexes, not merely by the absence of certain cycles.

A decisive strengthening is that for a ternary graph without isolated vertices,
\[
\Ind(G)\text{ is a homology sphere} \iff \Ind(G)\simeq S^d,\quad d=\dim \Ind(G)
\]
[2509.21705]. In particular, when the independence complex is homotopy equivalent to a sphere of its full dimension, the complex is Gorenstein; equivalently, \(G\) is \(1\)-well-covered [2509.21705]. The proof isolates two mechanisms: if \(G\) is ternary and \(\Ind(G)\simeq S^d\) with \(d=\dim\Ind(G)\), then \(\Ind(G)\) is Cohen–Macaulay; if \(G\) is ternary and \(\Ind(G)\) is Cohen–Macaulay, then \(\Ind(G)\) is a pseudomanifold [2509.21705]. Combined with top-dimensional homology, this yields the Gorenstein conclusion.

For the narrower class of \((0,1)\)-ternary graphs, the topology is numerically controlled by domination parameters. If \(d(G)\neq *\), then
\[
d(G)+1=i(G)=\gamma(G)=\gamma(L(G)),
\]
where \(i(G)\) is the independent domination number, \(\gamma(G)\) the domination number, and \(\gamma(L(G))\) the domination number of the line graph [2508.00699]. This identity is not valid for all ternary graphs: for \(C_4\),
\[
I(C_4)\simeq S^0,\qquad d(C_4)=0,
\]
but
\[
i(C_4)=\gamma(C_4)=\gamma(L(C_4))=2
\]
[2508.00699]. The failure on \(C_4\) shows that ternaryness alone does not force the sharper domination equalities.

## 5. Planar ternary Gorenstein graphs as polytopal flag spheres

For planar ternary graphs, the spherical case is substantially stronger than ordinary Gorensteinness. If \(G\) is a planar ternary graph and \(\Ind(G)\) is a homology sphere, then
\[
\Ind(G)\text{ is combinatorially equivalent to the boundary of a simplicial polytope and is vertex decomposable}
\]
[2509.21705]. Since independence complexes are flag complexes, this places planar ternary Gorenstein graphs inside a tightly constrained class of flag spheres with strong shellability-type behavior.

The mechanism is classification-theoretic. The planar-ternary paper states that Trung’s classification makes connected planar Gorenstein graphs extremely restricted: essentially they are built from a family \(G_m\), plus one exceptional graph \(R_3\) [2509.21705]. It then shows that each \(G_m\) is ternary and that \(\Ind(G_m)\) is obtained from the boundary of a crosspolytope by edge subdivisions [2509.21705]. Edge subdivisions preserve the relevant polytopal structure, so these complexes remain boundaries of simplicial polytopes and remain vertex decomposable. For disjoint unions, one has
\[
\Ind(G\sqcup H)=\Ind(G)*\Ind(H),
\]
so the general planar case is obtained by joins of the connected building blocks [2509.21705].

As a result, for planar ternary graphs,
\[
\Ind(G)\text{ is homotopy equivalent to a sphere} \iff \Ind(G)\text{ is the boundary of a vertex decomposable simplicial polytope}
\]
[2509.21705]. This is a stronger conclusion than the planar Eulerian criterion alone: it does not merely certify Gorensteinness, but identifies the independence complex within a very rigid polytopal subclass.

## 6. Transformations, partition refinement, and Delannoy \(h\)-polynomials

The mutation structure of these planar ternary flag spheres is governed by edge subdivisions and contractions. Let \(T_d\) denote the Lutz–Nevo graph whose vertices are flag PL spheres and whose edges correspond to edge subdivisions and contractions. The planar-ternary paper defines the partition refinement graph \(P_n\) as the Hasse diagram of the refinement poset on partitions of \(n\), and proves that
\[
P_d \text{ is an induced subgraph of } T_d
\]
for every \(d\) [2509.21705]. More precisely, if \(H_{n-1}\) is the induced subgraph of \(T_{n-1}\) consisting of independence complexes of planar ternary graphs with independence number \(n\), then
\[
H_{n-1}\cong P_n
\]
[2509.21705].

This correspondence is explicit. Vertices of \(H_{n-1}\) are indexed by disjoint unions
\[
G_{m_1}\sqcup \cdots \sqcup G_{m_s},\qquad m_1+\cdots+m_s=n,
\]
so they are naturally indexed by partitions of \(n\) [2509.21705]. An edge in the refinement graph corresponds to an allowed edge subdivision that merges two connected components \(G_{m_i}\) and \(G_{m_j}\) into \(G_{m_i+m_j}\). A crucial restriction is that subdividing an edge whose endpoints lie in the same \(G_m\)-component leaves the planar ternary class [2509.21705]. Thus the admissible moves are exactly the partition-merging moves.

The same rigidity appears in the \(h\)-vector. For connected planar ternary \(G_m\),
\[
h_k(\Ind(G_m))=d(m,k),
\]
where \(d(m,k)=D(m-k,k)\) and \(D(\cdot,\cdot)\) is a Delannoy number [2509.21705]. Equivalently,
\[
h(\Ind(G_m),t)=\sum_{k=0}^m d(m,k)t^k,
\]
so the \(h\)-polynomial is a Delannoy polynomial [2509.21705]. Since the zeros of these Delannoy polynomials are negative real numbers, the \(h\)-polynomial is real-rooted; for disjoint unions, multiplicativity under joins gives
\[
h(\Ind(G\sqcup H),t)=h(\Ind(G),t)\,h(\Ind(H),t)
\]
[2509.21705]. The paper further notes that real-rootedness implies \(\gamma\)-positivity in this setting [2509.21705].

## 7. Adjacent notions, limitations, and common sources of confusion

Several neighboring theories are relevant but non-equivalent. First, the Gorenstein property of graphs can depend on the characteristic of the base field: one example is obtained from a graph whose independence complex comes from a triangulation of \(\mathbb{RP}^3\), which is Gorenstein only when \(\operatorname{char}(k)\neq 2\) [1508.07713]. The triangle-free classification is exceptional precisely because it yields a characteristic-free graph-theoretic criterion via \(W_2\) and Cohen–Macaulayness of \(I(G)^2\) [1508.07713].

Second, pseudo-Gorenstein\(^*\) is strictly weaker than Gorensteinness. It is defined by the conditions that the top coefficient of the \(h\)-polynomial is \(1\) and \(\mathfrak a(S/I(G))=0\), equivalently
\[
G \text{ is pseudo-Gorenstein}^{*} \iff P_G(-1)=(-1)^{\alpha(G)}
\]
[2603.08502]. This criterion supplies a concrete extremal test for planar ternary candidates, but it does not characterize Gorensteinness because Cohen–Macaulayness is not assumed [2603.08502]. The same paper gives exact congruence classifications for paths and cycles, including
\[
C_n \text{ is pseudo-Gorenstein}^{*} \iff n\equiv 1,2,5,10 \pmod{12}
\]
and
\[
P_n \text{ is pseudo-Gorenstein}^{*} \iff n\equiv 0,2,9,11 \pmod{12}
\]
[2603.08502].

Third, the phrase *Gorenstein graphic matroids* refers to a different algebraic object. The toric ring \(\mathbb{C}[B(M(G))]\) of the base polytope of a graphic matroid is Gorenstein exactly when each \(2\)-connected component is built, for \(d>2\), from a \(d\)-cycle by repeated edge-gluing and \((d-1)\)-subdivision of weight-\(1\) edges, or, for \(d=2\), from \(K_4\) by repeated collision operations [1905.05418]. These classified graphs are planar in the relevant cases, but the paper does not formulate a ternary-specific criterion, and its Gorenstein notion is toric-matroidal rather than the edge-ideal notion used for independence complexes [1905.05418].

Taken together, the literature provides three complementary recognition principles for the edge-ideal notion of Gorensteinness: Eulerianity of \(\Ind(G)\) for planar graphs, membership in \(W_2\) together with triangle-freeness for the \(I(G)^2\)-criterion, and full-dimensional spherical homotopy type for ternary graphs [1603.00326][1508.07713][2509.21705]. In the planar ternary setting, these principles converge on a remarkably rigid class of flag spheres whose graph-theoretic, topological, and enumerative invariants are all tightly constrained.

Source: https://www.emergentmind.com/topics/gorenstein-planar-ternary-graphs