# Global rigidity of complete bipartite graphs

Authors: | Robert Connelly, Steven J. Gortler, and Louis Theran |

Preprint: | 2105.01389, 2021 |

Full text: | arXiv |

This note gives a detailed proof of the following statement. Let \(d\in \mathbb{N}\) and \(m,n\ge d+1\), with \(m+n\ge \binom{d+2}{2}+1\). Then the complete bipartite graph \(K_{m,n}\) is generically globally rigid in dimension \(d\).