Abstract
We prove that a graph has an infinitesimally rigid placement in a non-Euclidean normed plane if and only if it contains a $(2,2)$-tight spanning subgraph. The method uses an inductive construction based on generalised Henneberg moves and the geometric properties of the normed plane. As a key step, rigid placements are constructed for the complete graph $K_4$ by considering smoothness and strict convexity properties of the unit ball.
| Original language | English |
|---|---|
| Pages (from-to) | 1205 - 1231 |
| Number of pages | 27 |
| Journal | SIAM Journal on Discrete Mathematics |
| Volume | 34 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 26 May 2020 |
Bibliographical note
27 pagesKeywords
- math.MG
- 52C25, 52A21
Fingerprint
Dive into the research topics of 'Infinitesimal rigidity in normed planes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver