2000 character limit reached
Sufficient connectivity conditions for rigidity of symmetric frameworks
Published 27 Apr 2018 in math.CO | (1804.10458v1)
Abstract: It is a famous result of Lovasz and Yemini (1982) that 6-connected graphs are rigid in the plane. This was recently improved by Jackson and Jordan (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give sufficient graph connectivity conditions for both forced symmetric' andincidentally symmetric' infinitesimal rigidity in the plane.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.