Tibor Jordán

activity

20222026

most citedPartial reflections and globally linked pairs in rigid graphs

3 citations · 7 across the 7 of their papers we have counts for

collaborators

7 papers

math.CO2026

Rank Contributions of Vertices in Rigidity Matroids of Clique Covered Graphs

Bill Jackson, Tibor Jordán, Soma Villányi

The problems of characterizing the graphs $G$ which are generically rigid in $R^{d}$ , or more generally, determining the rank function of the $d$ -dimensional rigidity matro…

math.CO2024

Globally linked pairs and cheapest globally rigid supergraphs

Tibor Jordán, Soma Villányi

Given a graph $G$ , a cost function on the non-edges of $G$ , and an integer $d$ , the problem of finding a cheapest globally rigid supergraph of $G$ in $R^{d}$ is NP-hard for…

math.CO2024★ 1 cited

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.CO2023

Globally linked pairs of vertices in generic frameworks

Tibor Jordán, Soma Villányi

A $d$ -dimensional framework is a pair $(G, p)$ , where $G = (V, E)$ is a graph and $p$ is a map from $V$ to $R^{d}$ . The length of an edge $x y \in E$ in $(G, p)$ is the distance be…

math.CO2023

On generic universal rigidity on the line

Guilherme Zeus Dantas e Moura, Tibor Jordán, Corwin Silverman

A $d$ -dimensional bar-and-joint framework $(G, p)$ with underlying graph $G$ is called universally rigid if all realizations of $G$ with the same edge lengths, in all dimensions, ar…

math.CO2023★ 3 cited

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…

math.CO2022★ 3 cited

Count and cofactor matroids of highly connected graphs

Dániel Garamvölgyi, Tibor Jordán, Csaba Király

We consider two types of matroids defined on the edge set of a graph $G$ : count matroids $M_{k, ℓ} (G)$ , in which independence is defined by a sparsity count involving the…