Dániel Garamvölgyi

activity

20212024

most citedMinimally globally rigid graphs

11 citations · 28 across the 5 of their papers we have counts for

collaborators

5 papers

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★ 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…

math.CO2022★ 11 cited

Minimally globally rigid graphs

Dániel Garamvölgyi, Tibor Jordán

A graph $G = (V, E)$ is globally rigid in $R^{d}$ if for any generic placement $p : V \to R^{d}$ of the vertices, the edge lengths $∣∣ p (u) - p (v) ∣∣, uv \in E$ …

math.MG2021★ 10 cited

Globally rigid graphs are fully reconstructible

Dániel Garamvölgyi, Steven J. Gortler, Tibor Jordán

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 $uv \in E$ in $(G, p)$ is the distance be…