Sufficient connectivity conditions for rigidity of symmetric frameworks

Kaszanitzky, Viktoria and Schulze, Bernd (2023) Sufficient connectivity conditions for rigidity of symmetric frameworks. European Journal of Combinatorics, 109: 103639. ISSN 0195-6698

[thumbnail of Sufficient_Conn_Cond_EJC_Revised_2(1)]
Text (Sufficient_Conn_Cond_EJC_Revised_2(1))
Sufficient_Conn_Cond_EJC_Revised_2_1_.pdf - Accepted Version
Restricted to Repository staff only until 12 December 2024.
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.

Download (405kB)


It is a famous result of Lovász and Yemini that 6-connected graphs are rigid in the plane (Lovász and Yemini, 1982). This was recently improved by Jackson and Jordán (2009) 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.

Item Type:
Journal Article
Journal or Publication Title:
European Journal of Combinatorics
Additional Information:
This is the author’s version of a work that was accepted for publication in Physics Reports. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in European Journal of Combinatorics, 109, 2023 DOI: 10.1016/j.ejc.2022.103639
Uncontrolled Keywords:
?? computational theory and mathematicsgeometry and topologytheoretical computer science ??
ID Code:
Deposited By:
Deposited On:
28 Oct 2022 14:35
Last Modified:
15 May 2024 16:15