1 problem

The connectivity conjecture for globally rigid k-chains
Connectivity conjecture. Any $(d+1)$ -connected $k$ -chain in $\mathbb{R}^d$ with more than $\binom{d+2}{2}$ vertices is generically globally rigid.
openFrom papersglobal-rigidity graph-rigidity k-chains
0 responses
4

The connectivity conjecture for globally rigid k-chains