Abstract 3-Rigidity and Bivariate C₂¹-Splines II: Combinatorial Characterization
From MaRDI portal
Publication:5871271
Planar graphs; geometric and topological aspects of graph theory (05C10) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Spline approximation (41A15) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)
Abstract: We showed in the first paper of this series that the generic -cofactor matroid is the unique maximal abstract -rigidity matroid. In this paper we obtain a combinatorial characterization of independence in this matroid. This solves the cofactor counterpart of the combinatorial characterization problem for the rigidity of generic 3-dimensional bar-joint frameworks. We use our characterization to verify that the counterparts of conjectures of Dress (on the rank function) and Lov'{a}sz and Yemini (which suggested a sufficient connectivity condition for rigidity) hold for this matroid.
Recommendations
Cited in
(6)- Abstract 3-Rigidity and Bivariate $C_2^1$-Splines I: Whiteley's Maximality Conjecture
- Flexible circuits in the d‐dimensional rigidity matroid
- Ear‐decompositions, minimally connected matroids and rigid graphs
- Count and cofactor matroids of highly connected graphs
- Global rigidity of triangulated manifolds
- Maximal matroids in weak order posets
This page was built for publication: Abstract 3-Rigidity and Bivariate $C_2^1$-Splines II: Combinatorial Characterization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5871271)