\(K_{5, 5}\) is fully reconstructible in \(\mathbb{C}^3\)

DOI10.1016/j.dam.2022.06.004zbMath1498.05187arXiv2110.10224OpenAlexW4283323919MaRDI QIDQ2081511

Steven J. Gortler, Daniel Irving Bernstein

Publication date: 13 October 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

distance geometryreconstructibilitygraph rigidityunlabeled reconstruction

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance geometry (51K99) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Uses Software

• Macaulay2

Cites Work

• When is a bipartite graph a rigid framework?
• The number of embeddings of minimally rigid graphs
• Graph reconstruction from unlabeled edge lengths
• Generically globally rigid graphs have generic universally rigid frameworks
• Characterizing generic global rigidity
• Globally rigid graphs are fully reconstructible
• Algebraic Matroids in Action
• GENERIC UNLABELED GLOBAL RIGIDITY

This page was built for publication: \(K_{5, 5}\) is fully reconstructible in \(\mathbb{C}^3\)