Yayın: Coincident Rigidity of 2-Dimensional Frameworks
item.page.program
item.page.orgauthor
item.page.kuauthor
item.page.coauthor
Yazarlar
Danışman
Tarih
item.page.language
item.page.type
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Özet
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.
Açıklama
item.page.source
Yayınevi
Springer Science and Business Media LLC
item.page.keywords
Konusu
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)