Globally rigid graphs are fully reconstructible

DOI10.1017/fms.2022.44zbMath1494.05074arXiv2105.04363OpenAlexW3161521274MaRDI QIDQ5093811

Dániel Garamvölgyi, Steven J. Gortler, Tibor Jordán

Publication date: 1 August 2022

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.04363

zbMATH Keywords

graph reconstruction

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Flexible circuits in the d‐dimensional rigidity matroid ⋮ Ear‐decompositions, minimally connected matroids and rigid graphs ⋮ \(K_{5, 5}\) is fully reconstructible in \(\mathbb{C}^3\) ⋮ Minimally globally rigid graphs

Uses Software

• LamanGraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coning, symmetry and spherical frameworks
• Generic global rigidity of body-hinge frameworks
• Global rigidity: The effect of coning
• Linear systems of hyperplane sections on varieties of low codimension
• Connected rigidity matroids and unique realizations of graphs
• Graph reconstruction from unlabeled edge lengths
• Global rigidity of triangulations with braces
• Generic global rigidity
• On the superadditivity of secant defects
• Characterizing generic global rigidity
• Conditions for Unique Graph Realizations
• The Rigidity of Graphs
• The Number of Realizations of a Laman Graph
• Algebraic Matroids in Action
• GENERIC UNLABELED GLOBAL RIGIDITY
• Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces
• Basic Algebraic Geometry 1

This page was built for publication: Globally rigid graphs are fully reconstructible