Publication: Coincident Rigidity of 2-Dimensional Frameworks
Loading...
Date
Organizational Units
Authors
Advisor
Editor
Journal Title
Journal ISSN
Volume Title
Type:
Publisher
Springer Science and Business Media LLC
DOI
10.1007/s00373-022-02540-9
Abstract
Fekete, Jordán and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their characterisation to an arbitrary set T of vertices and verify our conjecture when |T| = 3.
Description
Journal or Series
Graphs and Combinatorics
ISSN
0911-0119
ISBN
Keywords
Infinitesimal rigidity , Combinatorial aspects of matroids and geometric lattices , count matroid , Count matroid , Planar graphs , geometric and topological aspects of graph theory , C25 , infinitesimal rigidity , Rigidity and flexibility of structures (aspects of discrete geometry) , Coincident points , FOS: Mathematics , Mathematics - Combinatorics , coincident points , Combinatorics (math.CO)
Citation
Collections
Endorsement
Review
Supplemented By
Referenced By
Rights and licensing
info:eu-repo/semantics/openAccess
