|
Garamvölgyi and Jordán [4] recently showed that every minimally globally rigid graph in $\R^d$ contains a vertex of degree at most $2d+1$, and gave examples with minimum degree $d+2$ for all $d\geq 3$. We construct examples of minimally globally rigid graphs in $\R^d$ with minimum degree at least $2d-1$, for all $d\geq 1$.
Bibtex entry:
| AUTHOR | = | {Jackson, Bill and Jord{\'a}n, Tibor}, |
| TITLE | = | {Minimally globally rigid graphs with high minimum degree}, |
| NOTE | = | {{\tt egres.elte.hu}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2024}, |
| NUMBER | = | {TR-2024-04} |