Graver's Maximality Conjecture in Rigidity Matroids

• Graver's Maximality Conjecture is a theoretical framework in rigidity matroid theory that posits a unique maximal abstract d-rigidity matroid on the complete graph Kₙ for fixed n and d.
• It employs dual formulations via symmetric tensor matroids and rigorous combinatorial sparsity criteria to characterize rigidity and maximality across various dimensions.
• Notably, the conjecture is confirmed for d = 1, 2 and uniquely resolved in dimension 3, while failing for d ≥ 4, highlighting intricate boundaries and computational challenges.

Graver's Maximality Conjecture is a conjecture in rigidity matroid theory concerning abstract $d$-rigidity matroids on the edge set of the complete graph $K_n$, ordered by the weak order. In its standard form, it asks whether, for fixed $n$ and $d$, this family has a unique maximal element, and whether that maximal element is the generic $d$-dimensional rigidity matroid $\mathcal{R}_d(K_n)$. The conjecture is proved for $d=1$ and $d=2$, false for $d \geq 4$, and structurally most significant in dimension $3$, where uniqueness and identification with $K_n$0 separate into distinct issues. Recent work also recasts the conjecture through matroid duality in terms of symmetric tensor matroids, while a distinct strand of the Graver-complexity literature uses the same label for a maximality statement about Lawrence liftings and Graver complexity (Jackson et al., 18 Mar 2025, Clinch et al., 2019, Kudo et al., 2011).

1. Conjecture in the language of abstract rigidity matroids

For matroids $K_n$1 on the same ground set $K_n$2, the weak order is defined by

$K_n$3

Graver's conjecture asks for a unique maximal abstract $K_n$4-rigidity matroid with respect to this order, and conjecturally identifies it with $K_n$5 (Clinch et al., 2019).

An abstract $K_n$6-rigidity matroid $K_n$7 on $K_n$8, for $K_n$9, is defined by closure axioms. If $n$0, then:

• if $n$1, one requires

$n$2

• if $n$3 for $n$4 and $n$5, one requires

$n$6

These are the gluing and separation axioms that abstract the behavior of generic rigidity (Jackson et al., 18 Mar 2025).

The same family admits more operational characterizations. A matroid $n$7 is an abstract $n$8-rigidity matroid if and only if it satisfies equivalent rank, circuit, cocircuit, and extension properties: $n$9 every copy of $d$0 is a circuit, every copy of $d$1 is a cocircuit, and if $d$2, $d$3 has degree $d$4, and $d$5 is independent, then $d$6 is independent (Jackson et al., 18 Mar 2025). In the special case $d$7, Nguyen's characterization used in subsequent work identifies abstract $d$8-rigidity matroids with $d$9-matroids of rank $d$0 (Clinch et al., 2019).

2. Dual formulation via symmetric tensor matroids

A major recent reformulation uses matroid duality. Writing $d$1, an abstract symmetric $d$2-tensor matroid on $d$3, for $d$4, is defined by the dual conditions

$d$5

every copy of $d$6 is a circuit, and every $d$7 is a cocircuit (Jackson et al., 18 Mar 2025).

The key lemma is exact dual equivalence: a matroid $d$8 is an abstract symmetric $d$9-tensor matroid if and only if its dual is an abstract $\mathcal{R}_d(K_n)$0-rigidity matroid for $\mathcal{R}_d(K_n)$1. In particular, the geometric symmetric $\mathcal{R}_d(K_n)$2-tensor matroid belongs to this family. Theorem-level duality results highlighted by this literature state that, for all $\mathcal{R}_d(K_n)$3, the generic rigidity matroid $\mathcal{R}_d(K_n)$4 is dual to the symmetric $\mathcal{R}_d(K_n)$5-tensor matroid $\mathcal{R}_d(K_n)$6 (Jackson et al., 18 Mar 2025).

This reformulation produces a dual version of Graver's conjecture: among all abstract symmetric $\mathcal{R}_d(K_n)$7-tensor matroids on $\mathcal{R}_d(K_n)$8, there should be a unique maximal matroid. Because uniqueness on one side implies uniqueness on the other by duality, the rigidity and symmetric-tensor versions are equivalent as maximality statements. This dual viewpoint also connects the conjecture to matrix and tensor completion matroids, rather than only to rigidity-theoretic closure phenomena (Jackson et al., 18 Mar 2025).

3. The three-dimensional case and Whiteley's cofactor matroid

The case $\mathcal{R}_d(K_n)$9 is distinguished by the absence of a purely combinatorial characterization of $d=1$0, and by Whiteley's analogous conjecture from spline theory. Whiteley observed a close similarity between the generic $d=1$1-dimensional rigidity matroid and the generic $d=1$2-cofactor matroid, and conjectured that the latter is the unique maximal abstract $d=1$3-rigidity matroid for all $d=1$4. For $d=1$5, this becomes the statement that the generic $d=1$6-cofactor matroid $d=1$7 is the unique maximal abstract $d=1$8-rigidity matroid on $d=1$9 (Clinch et al., 2019).

That $d=2$0 case is proved. The main theorem establishes that $d=2$1 is the unique maximal abstract $d=2$2-rigidity matroid on $d=2$3, and in a stronger form that it is the unique maximal $d=2$4-matroid of rank $d=2$5 on $d=2$6. This proves the first part of Graver's conjecture for $d=2$7: uniqueness of the maximal abstract $d=2$8-rigidity matroid. It does not resolve whether

$d=2$9

so the identification of the maximal matroid with generic $d \geq 4$0-dimensional rigidity remains open (Clinch et al., 2019).

The proof is inductive and graph-constructive. Bases of the generic cofactor matroid are generated from $d \geq 4$1 using $d \geq 4$2-extension, $d \geq 4$3-extension, $d \geq 4$4-replacement, and double $d \geq 4$5-replacement, and the technically decisive step is that double $d \geq 4$6-replacement preserves $d \geq 4$7-independence. Whiteley had identified this as the final unresolved step for the $d \geq 4$8 cofactor setting. The result therefore closes the cofactor side of the maximality problem in dimension $d \geq 4$9, while leaving the rigidity-side equality question open (Clinch et al., 2019).

4. Positive results for small tensor order and for $3$0

A broader affirmative range is now known through the symmetric-tensor formulation. For $3$1 and $3$2, the symmetric tensor matroid $3$3 is the unique maximal abstract symmetric $3$4-tensor matroid on $3$5. By duality, this is equivalent to the statement that, for all $3$6, the rigidity matroid $3$7 is the unique maximal abstract $3$8-rigidity matroid (Jackson et al., 18 Mar 2025).

The proof proceeds by a new circuit-based sparsity criterion. Independence is tested by a count condition determined by a family $3$9 of graphs, refined by isomorphism class rather than just cardinality. For $K_n$00, a graph is independent in $K_n$01 if and only if it is count independent with respect to this family, and all maximally independent sets in any other abstract symmetric tensor matroid coincide with those of $K_n$02. Because this criterion is matroidal, it yields uniqueness rather than only extremality (Jackson et al., 18 Mar 2025).

This result has two distinct consequences. First, it confirms Graver-type unique maximality in a substantial finite-codimension range, namely $K_n$03. Second, through duality, it provides a new noncomputational route to previously computer-assisted rigidity results in that range. A plausible implication is that the obstruction to further extension lies not in the basic dual framework, but in the breakdown of the count characterization beyond small $K_n$04.

5. Failure modes, boundaries, and related families

The conjecture does not hold uniformly. It is proved for $K_n$05 and $K_n$06, but for $K_n$07 it is false, with non-uniqueness established by Thurston and Whiteley (Clinch et al., 2019). In the symmetric-tensor language, the $K_n$08 theorem marks a positive zone, while for $K_n$09 the count characterization can fail, and with it uniqueness (Jackson et al., 18 Mar 2025).

A related misconception is that uniqueness is robust under modest enlargement of the matroid family. The recent literature shows the opposite. If one weakens the axioms and considers $K_n$10-matroids, meaning matroids on $K_n$11 in which every copy of $K_n$12 is a circuit, then uniqueness survives only for $K_n$13. For $K_n$14 and sufficiently large $K_n$15, there are at least two distinct maximal $K_n$16-matroids on $K_n$17. The same phenomenon passes to the family of second quasi symmetric powers of the uniform matroid $K_n$18: they do not have a unique maximal element for $K_n$19 and sufficiently large $K_n$20 (Jackson et al., 18 Mar 2025).

Setting	Maximality status	Source
Abstract $K_n$21-rigidity, $K_n$22	Proved	(Clinch et al., 2019)
Abstract $K_n$23-rigidity	Unique maximal matroid exists; $K_n$24 is that maximum	(Clinch et al., 2019)
Identification $K_n$25	Open	(Clinch et al., 2019)
Abstract $K_n$26-rigidity, $K_n$27	$K_n$28 uniquely maximal	(Jackson et al., 18 Mar 2025)
Abstract $K_n$29-rigidity, $K_n$30	False in general	(Clinch et al., 2019)
$K_n$31-matroids, $K_n$32	No unique maximal element for large $K_n$33	(Jackson et al., 18 Mar 2025)

The boundary results matter because they show that the exact choice of family is essential. Positive results for abstract rigidity matroids and abstract symmetric tensor matroids do not automatically extend to larger circuit-defined families.

6. A distinct Graver-complexity usage of “maximality”

In the Graver-complexity literature, the name “Graver's Maximality” is also attached to a conjecture about Lawrence liftings and complete bipartite incidence matrices. In this setting, for the incidence matrix $K_n$34 of $K_n$35, the conjecture is that for any positive integers $K_n$36, the sequence

$K_n$37

is non-decreasing in $K_n$38 and is maximized by the Lawrence lifting $K_n$39 (Kudo et al., 2011).

Kudo and Takemura give an explicit exponential lower bound for the Graver complexity of $K_n$40. For $K_n$41,

$K_n$42

where

$K_n$43

For fixed $K_n$44, this yields

$K_n$45

It generalizes the Berstein–Onn bound for $K_n$46,

$K_n$47

and is presented as evidence supporting, though not proving, the maximality conjecture in that setting (Kudo et al., 2011).

A related recursive construction for $K_n$48-fold matrices strengthens the lower bound for $K_n$49 to

$K_n$50

and more generally gives

$K_n$51

The construction turns primitive relations on Graver basis elements of $K_n$52 into primitive relations for $K_n$53, and the paper explicitly states that the bound for $K_n$54 is not tight (Finhold et al., 2013). This suggests that, in the complexity-theoretic usage of the term, maximality questions are accompanied by genuinely explosive combinatorics.

7. Current obstacles: implied nonedges, nucleations, and algorithmic relevance

The current $K_n$55-dimensional frontier is shaped by the conjectural isomorphism

$K_n$56

where $K_n$57 is Whiteley's cofactor matroid, described as the unique maximal matroid over the edge set of $K_n$58 in which all graphs isomorphic to $K_n$59 are circuits (Cheng et al., 17 Aug 2025). Recent work isolates a class of graphs that appear to be the main obstruction to either proving or refuting this identification.

Two notions are central. An implied nonedge is a nonedge $K_n$60 of a graph $K_n$61 such that $K_n$62 contains a circuit including $K_n$63. A nucleation is a rigid subgraph on at least $K_n$64 vertices, and a graph is nucleation-free if it has no such subgraph. The 2025 constructions produce independent graphs with implied nonedges but no non-trivial rigid subgraphs, and some of the constructions apply to $K_n$65-dimensional abstract rigidity matroids as well (Cheng et al., 17 Aug 2025).

One explicit family is given by rings of butterflies: for $K_n$66 butterflies, the ring is independent and nucleation-free, but the hinges are implied nonedges. The paper emphasizes that none of these examples refutes the maximality conjecture, because the relevant properties hold in both $K_n$67 and $K_n$68. Their significance lies elsewhere. They identify the “especially intractable” flexible circuits that obstruct a simple combinatorial characterization and complicate any polynomial-time independence algorithm for the maximal matroid. The paper also singles out a potential counterexample pattern: a graph $K_n$69 with a nonedge $K_n$70 that is implied in $K_n$71 but is not contained in any $K_n$72 in the closure $K_n$73 (Cheng et al., 17 Aug 2025).

Taken together, these developments place Graver's Maximality Conjecture at the intersection of rigidity theory, matroid duality, spline/cofactor methods, and Graver-complexity growth. The conjecture is no longer a single undifferentiated assertion: uniqueness, explicit identification of the maximal matroid, robustness under family enlargement, and algorithmic recognizability have emerged as separate but tightly coupled problems.