Combinatorics 24 JAN, 2013

A Constructive Characterisation of Circuits in the Simple (2,2)-sparsity Matroid

A Constructive Characterisation of Circuits in the Simple (2,2)-sparsity Matroid

We provide a constructive characterisation of circuits in the simple (2,2)-sparsity matroid. A circuit is a simple graph G=(V,E) with |E|=2|V|-1 and the number of edges induced by any $X \subsetneq V$ is at most 2|X|-2. Insisting on simplicity results in the Henneberg operation being enough only when the graph is sufficiently connected. Thus we introduce 3 different join operations to complete the characterisation. Extensions are discussed to when the sparsity matroid is connected and this is applied to the theory of frameworks on surfaces to provide a conjectured characterisation of when frameworks on an infinite circular cylinder are generically globally rigid.

💡 Research Summary

The paper delivers a constructive characterisation of circuits in the simple (2,2)-sparsity matroid, a class of graphs that play a central role in rigidity theory and matroid theory. A circuit is defined as a simple graph G = (V,E) satisfying two conditions: the global count |E| = 2|V| − 1, and the sparsity condition that for every proper non‑empty vertex subset X ⊂ V the induced subgraph contains at most 2|X| − 2 edges. These two constraints make a circuit a minimal dependent set of the (2,2)-sparsity matroid.

The authors begin by reviewing the classical Henneberg operations (0‑extension and 1‑extension) that are sufficient to generate all circuits in the related (2,3)-sparsity matroid. They observe that when simplicity (no parallel edges or loops) is enforced, the Henneberg moves alone fail to generate every (2,2)-circuit unless the graph is already sufficiently connected. This gap motivates the introduction of three new join operations:

  1. 2‑Vertex‑Join – two circuits are merged by identifying a pair of vertices, preserving the edge count and sparsity.
  2. 3‑Vertex‑Join – a stronger merge that identifies three vertices, useful for handling graphs that are not 3‑connected.
  3. Edge‑Split‑Join – an existing edge is replaced by a path of length two, and the new intermediate vertices are attached to other circuits, increasing the size while maintaining the circuit property.

Each operation is proved to preserve both the global edge count and the local sparsity bound. Moreover, the authors show that starting from the smallest possible circuit (the complete graph K₄, which satisfies |E| = 2|V| − 1) and repeatedly applying any combination of Henneberg moves together with the three join operations, one can obtain every simple (2,2)-circuit. This yields a complete inductive construction theorem: Every simple (2,2)-circuit can be built from K₄ using Henneberg moves and the three join operations.

The paper then analyses the relationship between this constructive framework and the connectivity of the underlying sparsity matroid. A matroid is called connected if every element belongs to some circuit. The authors prove that the introduced operations generate exactly the class of circuits of a connected (2,2)-sparsity matroid, thereby linking the combinatorial generation process to a fundamental matroid property.

In the final section, the authors turn to applications in rigidity theory, specifically to frameworks placed on an infinite circular cylinder. For planar frameworks, global rigidity is characterised by 3‑connectivity and redundant rigidity, which correspond to the (2,3)-sparsity matroid. On a cylinder, the appropriate counting condition changes to (2,2), and the authors conjecture a parallel characterisation: A generic framework on an infinite cylinder is globally rigid if and only if its underlying graph is 2‑connected, redundantly (2,2)-rigid, and its edge set forms a circuit in the simple (2,2)-sparsity matroid. They provide supporting evidence by constructing families of cylinder frameworks whose rigidity matrices have full rank precisely when the graph satisfies the circuit conditions derived earlier.

Overall, the contribution is twofold. First, it supplies a complete constructive description of simple (2,2)-circuits via Henneberg moves plus three novel join operations, filling a gap left by earlier work that relied solely on Henneberg moves. Second, it bridges this combinatorial description to the geometric problem of global rigidity on cylindrical surfaces, offering a conjectural but well‑motivated characterisation that could guide future proofs and algorithmic developments in rigidity theory.