Dense graphs have rigid parts

DOI10.1007/s00454-022-00477-7zbMath1514.05087arXiv1901.10631OpenAlexW2961715688MaRDI QIDQ6045785

József Solymosi, Orit E. Raz

Publication date: 12 May 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.10631

zbMATH Keywords

distinct distancesgraph rigiditylines in 3Drigid subgraphs

Mathematics Subject Classification ID

Other designs, configurations (05B30) Erd?s problems and related topics of discrete geometry (52C10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Graph representations (geometric and intersection representations, etc.) (05C62) Density (toughness, etc.) (05C42)

Cites Work

• Szemerédi-Trotter-type theorems in dimension 3
• On the Erdős distinct distances problem in the plane
• When is a bipartite graph a rigid framework?
• Configurations of lines in space and combinatorial rigidity
• On graphs and rigidity of plane skeletal structures
• On the Classification of Motions of Paradoxically Movable Graphs
• The Rigidity of Graphs
• Incidences in Three Dimensions and Distinct Distances in the Plane
• When does a planar bipartite framework admit a continuous deformation?

This page was built for publication: Dense graphs have rigid parts