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

Showing 2022Show all

2 papers · 1 filter

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