A counter-example to Baranyai's combinatorial characterisation for 3-rigidity
Abstract
Recently Baranyai described a necessary combinatorial characterisation of graph rigidity for dimension 3. In this short note we provide a counter-example to the converse of the condition. Additionally, we provide an alternative proof to the Baranyai's necessary condition.
Fields of Study & Subjects
Advanced Combinatorial Mathematics
Advanced Graph Theory Research
Structural Analysis and Optimization
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 27 January 2026
- Document type
- Preprint