3 papers
math.CO2025
Degree Sum Conditions for Graph Rigidity
Tibor Jordán, Xuemei Liu, Soma Villányi
We study sufficient conditions for the generic rigidity of a graph expressed in terms of (i) its minimum degree , or (ii) the parameter $η(G)=\min_{uv\notin E}(°(u)+°(v))…
math.CO2025
Sparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory
Dániel Garamvölgyi, Bill Jackson, Tibor Jordán
A graph is -independent (resp. -connected) if its -dimensional generic rigidity matroid is free (resp. connected). A result of Maxwell from 1867 im…
math.HO2025
Rigidity of Graphs and Frameworks: A Matroid Theoretic Approach
James Cruickshank, Bill Jackson, Tibor Jordán +1
A -dimensional (bar-and-joint) framework consists of a graph and a realisation . It is rigid if every continuous motion of the vertices wh…