Every \(d(d + 1)\)-connected graph is globally rigid in \(\mathbb{R}^d\) (Q6987048)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8037089
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every \(d(d + 1)\)-connected graph is globally rigid in \(\mathbb{R}^d\) |
scientific article; zbMATH DE number 8037089 |
Statements
Every \(d(d + 1)\)-connected graph is globally rigid in \(\mathbb{R}^d\) (English)
0 references
7 May 2025
0 references
graph connectivity
0 references
rigidity
0 references
global rigidity
0 references
probabilistic method
0 references
