Every d(d + 1)-connected graph is globally rigid in R^d

DOI10.1016/J.JCTB.2025.01.005MaRDI QIDQ6987048zbMATH OpenFDO

Authors Soma Villányi

Publication date 7 May 2025

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2025.01.005

zbMATH Keywords

global rigiditygraph connectivityprobabilistic methodrigidity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Cites work

• Abstract 3-Rigidity and Bivariate C₂¹-Splines II: Combinatorial Characterization
• Characterizing generic global rigidity
• Conditions for Unique Graph Realizations
• Connected rigidity matroids and unique realizations of graphs
• Generic global rigidity
• Generic global rigidity of body-bar frameworks
• Generic global rigidity of body-hinge frameworks
• Globally linked pairs of vertices in generic frameworks
• Graphs and geometry
• Highly connected molecular graphs are rigid in three dimensions
• scientific article; zbMATH DE number 3917126 (Why is no real title available?)
• scientific article; zbMATH DE number 3493472 (Why is no real title available?)
• scientific article; zbMATH DE number 501471 (Why is no real title available?)
• scientific article; zbMATH DE number 952952 (Why is no real title available?)
• Minimally globally rigid graphs
• On Abstract Rigidity Matroids
• On Generic Rigidity in the Plane
• On graphs and rigidity of plane skeletal structures
• Sufficient conditions for the global rigidity of graphs
• The Rigidity of Graphs
• Über die Gliederung ebener Fachwerke.

Cited in

(4)

• Rigidity and reconstruction in matroids of highly connected graphs
• Minimum degree conditions for graph rigidity
• Rigid partitions: from high connectivity to random graphs
• Highly connected orientations from edge-disjoint rigid subgraphs

This page was built for publication: Every \(d(d + 1)\)-connected graph is globally rigid in \(\mathbb{R}^d\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987048)