|
Let $d$ be a positive integer. We prove that a complete bipartite graph $K_{m,n}$ on at least three vertices is globally rigid in $\RR^d$ if and only if $m,n \geq d+1$ and $m+n \geq \binom{d+2}{2}+1$.
Bibtex entry:
| AUTHOR | = | {Jord{\'a}n, Tibor}, |
| TITLE | = | {The globally rigid complete bipartite graphs}, |
| NOTE | = | {{\tt egres.elte.hu}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2022}, |
| NUMBER | = | {QP-2022-02} |