The minimally rigidity-connected stress-independence conjecture
Let be a minimally -connected graph, meaning that is -connected and deleting any edge destroys -connectedness.
Minimally -connected stress-independence conjecture. Every minimally -connected graph is -stress-independent.
The statement is known in dimension from the preceding discussion, and the conjecture asks whether it extends to all dimensions.
References
- Dániel Garamvölgyi, Bill Jackson and Tibor Jordán, “Sparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory”, arXiv:2509.03150 (2025).
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.