Vertex splitting, global rigidity and nondegenerate equilibrium stresses

Authors: James Cruickshank

Submitted to arXiv on 07 Nov. 2026
License: CC BY-SA 4.0
Abstract

We prove Whiteley's conjecture that every nontrivial vertex split of a generically globally rigid graph preserves generic global rigidity in \(\mathbbR^d\), for all \(d\geq1\). We give two proofs of the stronger assertion that the split graph is infinitesimally rigid at every generic coincident realisation of the two split vertices. Both proofs use maximum-rank equilibrium stress matrices and then apply the coincident-rigidity criterion of Cruickshank, Jackson and Tanigawa. The second construction also shows that every generically globally rigid graph admits a nondegenerate equilibrium stress of maximum rank at every generic realisation, establishing a conjecture of Jordán and Tanigawa.

The papers around it, by date and closeness

Higher is closer to this paper; left is older. Lines join papers close to each other: groups of lines are sub-topics. Select a point to see why it is there. Back to the summary of this paper

How to read this map? Illustrated guide

Closest papers Prior work it builds on Papers that cite it

Papers around this one

Ranked by how close their title and abstract are to this paper’s. Select some to read them together.

Closest papers

  1. Very close Same question Cited by this paper
    Vertex Splitting, Coincident Realisations, and Global Rigidity of Braced Triangulations
    J. Cruickshank, B. Jackson, Shin-ichi Tanigawa · 2020 · Discrete & Computational Geometry · cited 6 times · Not summarized yet

    Vertex Splitting, Coincident Realisations, and Global Rigidity of Braced Triangulations studies when vertex splitting preserves generic global rigidity, as this paper does.

    Abstract

    We give a relatively short graph theoretic proof of a result of Jordán and Tanigawa that a 4-connected graph which has a spanning plane triangulation as a proper subgraph is generically globally rigid in $${\mathbb {R}}^3$$ R 3 . Our proof is based on a new sufficient condition for the so called vertex splitting operation to preserve generic global rigidity in $${\mathbb {R}}^d$$ R d .

  2. Close Broader context
    Sharp Bounds on Torsional Rigidity of Metric Graphs with Signed Delta-Vertex Strengths
    Sedef Ozcan · 2026 · Not summarized yet

    Sharp Bounds on Torsional Rigidity of Metric Graphs with Signed Delta-Vertex Strengths studies torsional rigidity on metric graphs, rather than graph rigidity under vertex splitting.

    Abstract

    We study torsional rigidity on finite compact connected metric graphs with real \(\delta\)-vertex strengths in the regime of strictly positive torsion. For a fixed total length \(L>0\), let \(I_+\) be the sum of the positive strengths and \(I_-\) the sum of the magnitudes of the negative strengths, with \(I_+>I_-\). We determine the sharp infimum and the exact threshold for a finite universal supremum. The supremum is finite precisely when \(I_-<I_+/(1+LI_+)\). In this regime, an interval with strengths \(I_+\) and \(-I_-\) at opposite endpoints attains the sharp Saint--Venant bound. At and beyond the threshold, torsional rigidity is unbounded even among three-vertex paths with the same data…

  3. Close Broader context
    Destroying Rigidity in the Plane
    Yu Cong, Chao Xu, Ya-Jie Zhao · 2026 · Not summarized yet

    Destroying Rigidity in the Plane studies edge and vertex deletions that destroy rigidity, rather than vertex splits that preserve global rigidity.

    Abstract

    Rigidity and global rigidity are fundamental graph properties in discrete geometry, with applications to structural engineering and network localization. In two dimensions, both admit combinatorial characterizations in terms of the rigidity matroid and graph connectivity. We study the computational complexity of finding minimum-cost sets of edges or vertices whose deletion destroys either property in a finite simple graph. With unit costs, we give deterministic polynomial-time algorithms for edge deletion destroying global rigidity and vertex deletion destroying either property. We prove that edge deletion destroying rigidity is NP-hard and that, with positive integer costs, all four problem…

  4. Close Same question Cited by this paper Used in depth by this paper
    Global rigidity of triangulations with braces
    Tibor Jordán, Shin-ichi Tanigawa · 2019 · J. Comb. Theory B · cited 21 times · Not summarized yet

    Global rigidity of triangulations with braces studies generic global rigidity in three dimensions for graphs of triangulations with added braces.

    Abstract

    Abstract A.L. Cauchy proved that if the vertex-edge graphs of two convex polyhedra are isomorphic and corresponding faces are congruent then the two polyhedra are the same. This result implies that a convex polyhedron with triangular faces, as a bar-and-joint framework, is rigid. A framework is said to be globally rigid if the bar lengths uniquely determine all pairwise distances between the joints. Global rigidity implies rigidity. It is well-known that every three-dimensional generic bar-and-joint realisation of the graph of a convex polyhedron with triangular faces (that we call a triangulation) is rigid. It is also known that if the number of vertices is at least five then such a realisa…

  5. Close Same question Cited by this paper
    Global rigidity of triangulated manifolds
    J. Cruickshank, B. Jackson, Shin-ichi Tanigawa · 2022 · Advances in Mathematics · cited 14 times · Not summarized yet

    Global rigidity of triangulated manifolds characterizes which triangulated-manifold graphs are generically globally rigid in their embedding dimension.

    Abstract

    We prove that if $G$ is the graph of a connected triangulated $(d-1)$-manifold, for $d\geq 3$, then $G$ is generically globally rigid in $\mathbb R^d$ if and only if it is $(d+1)$-connected and, if $d=3$, $G$ is not planar. The special case $d=3$ verifies a conjecture of Connelly. Our results actually apply to a much larger class of simplicial complexes, namely the circuits of the simplicial matroid. We also give two significant applications of our main theorems. We show that that the characterisation of pseudomanifolds with extremal edge numbers given by the Lower Bound Theorem extends to circuits of the simplicial matroid. We also prove the generic case of a conjecture of Kalai concerning …

  6. Close Broader context
    On sparse universally rigid graphs in $\mathbb{R}$
    Ole Gabsdil, Ezra Hirschi, Julien Portier · 2026 · Not summarized yet

    On sparse universally rigid graphs in R studies universal rigidity and sparsity for graphs realized on the real line, not global rigidity under vertex splitting.

    Abstract

    A graph is said to be 1-universally rigid if, for any generic realization of its vertices on the real line, the realization cannot be deformed out of the line in any higher-dimensional Euclidean space while preserving all edge lengths. In this paper, we investigate the sparsity of 1-universally rigid graphs in different manners. First, we show that an Erd\H{o}s-R\'enyi random graph $G(n,p)$ is 1-universally rigid with high probability whenever $p \geq C\log n \cdot \log\log n/n$ for some sufficiently large constant $C>0$. These techniques also imply the existence of 1-universally rigid graphs of arbitrarily large girth, which resolves a problem suggested by Dantas e Moura, Jord\'an, and Silv…

  7. Close* Groundwork for this paper Cited by this paper
    The rigidity of graphs
    L. Asimow, B. Roth · 1978 · Transactions of the American Mathematical Society · cited 598 times · Not summarized yet

    The rigidity of graphs is cited as foundational work on graph rigidity, a subject underlying this paper’s study of global rigidity.

  8. Related Broader context
    Stability and uniqueness of minimal disks in non-constant curvature
    Sébastien Alvarez, Thibault Lefeuvre, Ben Lowe et al. · 2026 · Not summarized yet

    Stability and uniqueness of minimal disks in non-constant curvature concerns uniqueness of minimal surfaces, not graph or framework rigidity.

    Abstract

    Nitsche proved that every smooth Jordan curve in $\mathbb{R}^3$ of total curvature at most $4\pi$ bounds a unique minimal disk, which is moreover strictly stable. We prove an analogue of this result for Riemannian $3$-balls with mean convex boundary, under an explicit pinching condition on the negative sectional curvature, together with a bound on the covariant derivative of the Ricci tensor. In this setting, every smooth Jordan curve in the boundary sphere of total curvature at most $4\pi$ bounds a unique embedded minimal disk which is strictly stable.

Prior work it builds on

  1. Related* Groundwork for this paper
    Generic Global Rigidity
    R. Connelly · 2005 · Discrete & Computational Geometry · cited 472 times · Not summarized yet

    Generic Global Rigidity is cited in this paper’s treatment of generic global rigidity of frameworks.

  2. Related* Groundwork for this paper
    Global Rigidity: The Effect of Coning
    R. Connelly, W. Whiteley · 2010 · Discrete & Computational Geometry · cited 99 times · Not summarized yet

    Global Rigidity: The Effect of Coning is cited as prior work on global rigidity of graphs and frameworks.

  3. Related* Groundwork for this paper
    Conditions for Unique Graph Realizations
    B. Hendrickson · 1992 · SIAM journal on computing (Print) · cited 635 times · Not summarized yet

    Conditions for Unique Graph Realizations is cited as prior work on conditions ensuring unique realizations of graphs.

  4. Related* Groundwork for this paper
    Rigid Two-Dimensional Frameworks with Two Coincident Points
    Zsolt Fekete, Tibor Jordán, Viktória E. Kaszanitzky · 2014 · Graphs and Combinatorics · cited 15 times · Not summarized yet

    Rigid Two-Dimensional Frameworks with Two Coincident Points is cited on coincident-point framework rigidity, a criterion used in this paper’s vertex-splitting proofs.

How are these papers found?

We compare the title and abstract of this paper with those of every paper summarized on this site, and with the papers Semantic Scholar recommends, those it cites and those citing it (for a much-cited paper, its most recent citations and, from OpenAlex, the most cited ones). Among the prior work and the follow-ups, the papers that use each other in depth, a method it uses and the much-cited follow-ups come a little higher. The levels (very close, close, related) come from the similarity of the texts, not from a judgment of quality; * marks a paper without an abstract, compared by its title. The sentence under a paper is written by an AI from the two abstracts: check it in the papers. A paper marked not relevant by three readers leaves the list.

Updated on 16 November 2026.

The illustrated guide to the papers around a paper