Global rigidity conjecture for graphs containing triangulations of surfaces

Let GG be a graph with a triangulation TT of a surface SS as a spanning subgraph. A graph is globally rigid when its generic realization is uniquely determined, up to Euclidean isometry, by its edge lengths. Global rigidity conjecture for triangulated surfaces. The graph GG is globally rigid if and only if GG is 44-connected and, when SS has genus zero, GTG\neq T. The conjecture extends the planar triangulation result to arbitrary surfaces. It appeared previously as a question and has been verified when SS is the sphere, projective plane, or torus; the general case remains open.

Sources & referencesView supporting material

Primary source

James Cruickshank, Bill Jackson and Shin-ichi Tanigawa, “Vertex Splitting, Coincident Realisations and Global Rigidity of Braced Triangulations”, arXiv:2002.08680 (2022).

Additional references

2 papers in this index state this conjecture (2010–2020). The statement above is taken from the most recent of them; the others are arXiv:1010.3605.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.