Global rigidity of complete bipartite graphs

MaRDI QIDQ6366785zbMATH OpenFDO

Authors Robert Connelly, Steven J. Gortler, Louis Theran

Publication date 4 May 2021

Abstract: This note gives a detailed proof of the following statement. Let $dinmathbbN$ and $m,nged+1$, with $$. Then the complete bipartite graph $K_{m,n}$ is generically globally rigid in dimension $d$.

This page was built for publication: Global rigidity of complete bipartite graphs

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