On generic 3-rigidity of graphs

2024/09/25 by Baranyai, Tamás
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2409.16741

Abstract

We aim to give an exact condition of generic 3 -rigidity of graphs relying on partitioning the edges into 3 subsets; such that each subset-pair gives a generically 2-rigid graph, either by themselves or after an appropriate edge-deletion.

Related

• Rigidity of nearly planar classes of graphs
• Generically globally rigid graphs have generic universally rigid\n frameworks
• Sufficient Conditions for the Global Rigidity of Graphs
• The generic rigidity of triangulated spheres with blocks and holes
• 5-regular graphs and the 3-dimensional rigidity matroid