Tibor Jordán

works on

body-pin graphs 1 clique-covered graphs 1 global rigidity 1 matroids 1 rigidity theory 1

From the 1 of 3 linked papers with an AI index.

activity

20242026

collaborators

3 papers

math.CO2026

Rank Contributions of Vertices in Rigidity Matroids of Clique Covered Graphs

Bill Jackson, Tibor JordÃ¡n, Soma VillÃ¡nyi

The paper studies how to compute the rank of the three‑dimensional rigidity matroid for graphs whose edges lie in large cliques, introducing vertex rank contributions and applying…

math.CO2025

Highly connected orientations from edge-disjoint rigid subgraphs

DÃ¡niel GaramvÃ¶lgyi, Tibor JordÃ¡n, Csaba KirÃ¡ly +1

We give an affirmative answer to a long-standing conjecture of Thomassen, stating that every sufficiently highly connected graph has a $k$ -vertex-connected orientation. We prove th…

math.CO2024

Partial reflections and globally linked pairs in rigid graphs

DÃ¡niel GaramvÃ¶lgyi, Tibor JordÃ¡n

A $d$ -dimensional framework is a pair $(G, p)$ , where $G$ is a graph and $p$ maps the vertices of $G$ to points in $R^{d}$ . The edges of $G$ are mapped to the corresponding l…