Highly connected rigidity matroids have unique underlying graphs

We also prove the reverse implication: if G is a k-connected graph for some k≥6 then its two-dimensional rigidity matroid is (k−2)-connected. Furthermore, we determine the connectivity of the d-dimensional rigidity matroid of the complete graph Kn, for all pairs of positive integers d,n.