scientific article; zbMATH DE number 17636

From MaRDI portal
Publication:3974964





[For the entire collection see Zbl 0726.00015.] Hendrickson's conjecture says: If a graph \(G\) is generically redundantly rigid in \({\mathbb{R}}^ d\) and \(G\) is \((d+1)\)-connected then for all generic configurations the graph \(G\) together with a configuration is globally rigid in \({\mathbb{R}}^ d\). This conjecture is true for \(d=1\), it looks very likely to be true for \(d=2\) as well. For \(d\geq 3\) counterexamples to Hendrickson's conjecture are given (for instance \(K_{5,5}\) is a counterexample in three-space).




Cited in
(35)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974964)