Publication: A necessary condition for generic rigidity of bar‐and‐joint frameworks in d‐space
Loading...
Date
Organizational Units
Authors
Advisor
Editor
Journal Title
Journal ISSN
Volume Title
Type:
Publisher
Wiley
DOI
10.1002/jgt.22737
Abstract
AbstractA graph is ‐sparse if each subset with induces at most edges in . Maxwell showed in 1864 that a necessary condition for a generic bar‐and‐joint framework with at least vertices to be rigid in is that should have a ‐sparse subgraph with edges. This necessary condition is also sufficient when but not when . Cheng and Sitharam strengthened Maxwell's condition by showing thateverymaximal ‐sparse subgraph of should have edges when . We extend their result to all .
Description
Journal or Series
Journal of Graph Theory
ISSN
0364-9024
ISBN
Keywords
rigidity matroid , Graph representations (geometric and intersection representations, etc.) , C25, 05C62, 70B15 , Combinatorial aspects of matroids and geometric lattices , Planar graphs , geometric and topological aspects of graph theory , infinitesimal rigidity , Rigidity and flexibility of structures (aspects of discrete geometry) , FOS: Mathematics , bar-joint framework , Mathematics - Combinatorics , Combinatorics (math.CO)
Citation
Collections
Endorsement
Review
Supplemented By
Referenced By
Rights and licensing
info:eu-repo/semantics/openAccess
