Maxwell-independence: a new rank estimate for the 3-dimensional generic rigidity matroid

DOI10.1016/j.jctb.2013.12.001zbMath1300.05052arXiv1010.4052OpenAlexW2022859983MaRDI QIDQ401493

Cheng Jialong, Meerea Sitharam

Publication date: 27 August 2014

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.4052

zbMATH Keywords

upper boundrankcover3D rigidity matroidinclusion-exclusion countMaxwell-independentMaxwell's condition

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

A necessary condition for generic rigidity of bar‐and‐joint frameworks in d‐space ⋮ The rigidity of infinite graphs ⋮ And yet it moves: Paradoxically moving linkages in kinematics ⋮ Rigid block and hole graphs with a single block

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rigidity of multi-graphs. I: Linking rigid bodies in n-space
• An algorithm for two-dimensional rigidity percolation: The pebble game
• Pebble game algorithms and sparse graphs
• The Dress conjectures on rank in the 3-dimensional rigidity matroid
• The \(d\)-dimensional rigidity matroid of sparse graphs
• ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID
• The Algebraic Geometry of Motions of Bar-and-Body Frameworks
• On Generic Rigidity in the Plane
• Conditions for Unique Graph Realizations
• Generic Rigidity Matroids with Dilworth Truncations
• A proof of the molecular conjecture
• A necessary condition for generic rigidity of bar‐and‐joint frameworks in d‐space

This page was built for publication: Maxwell-independence: a new rank estimate for the 3-dimensional generic rigidity matroid