The one-discus global-rigidity conjecture for discus-and-hole graphs
The one-discus global-rigidity conjecture for discus-and-hole graphs
Let be a discus-and-hole graph with exactly one discus. A framework is generically globally rigid in when generic realizations are uniquely determined up to Euclidean isometries by their edge lengths, and a graph is redundantly rigid in when it remains rigid after the deletion of any one edge.
One-discus global-rigidity conjecture. The graph is generically globally rigid in if and only if it is -connected and redundantly rigid in .
This is motivated by the known difficulty of global rigidity and by a conjecture of Connelly and Whiteley on vertex splitting. The corresponding vertex-splitting conjecture is still open, although it has been verified in special cases; the proposed characterization for discus-and-hole graphs is therefore open.
Sources & referencesView supporting material
Primary source
Bryan Gin-ge Chen, James Cruickshank and Derek Kitson, “Block-and-hole graphs: Constructibility and (3,0)-sparsity”, arXiv:2309.06804 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.