It is a famous result of Lovász and Yemini that 6-connected graphs are rigid in the plane. This was recently improved by Jackson and Jordán who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give sufficient graph connectivity conditions for both `forced symmetric' and `incidentally symmetric' infinitesimal rigidity in the plane.
Bibtex entry:
AUTHOR | = | {Kaszanitzky, Vikt{\'o}ria and Schulze, Bernd}, |
TITLE | = | {Sufficient connectivity conditions for rigidity of symmetric frameworks}, |
NOTE | = | {{\tt egres.elte.hu}}, |
INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
YEAR | = | {2018}, |
NUMBER | = | {TR-2018-04} |