Tibor Jordán

Rank Contributions of Vertices in Rigidity Matroids of Clique Covered Graphs

The problems of characterizing the graphs $G$ which are generically rigid in ${\mathbb R}^d$, or more generally, determining the rank function of the $d$-dimensional rigidity matroid ${\cal R}_d(G)$ of an arbitrary graph $G$, have been solved when $d\leq 2$ but are major open problems in discrete geometry when $d\geq 3...