D'aniel Garamvolgyi

collaborators

3 papers

math.CO2026

Sufficient conditions for bipartite rigidity, symmetric completability and hyperconnectivity of graphs

DÃ¡niel GaramvÃ¶lgyi, Bill Jackson, Tibor JordÃ¡n +1

We consider three matroids defined by Kalai in 1985: the symmetric completion matroid $S_{d}$ on the edge set of a looped complete graph; the hyperconnectivity matroid $\ma…

math.CO2025

Sparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory

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

A graph is $R_{d}$ -independent (resp. $R_{d}$ -connected) if its $d$ -dimensional generic rigidity matroid is free (resp. connected). A result of Maxwell from 1867 im…

math.CO2025

Stress-linked pairs of vertices and the generic stress matroid

DÃ¡niel GaramvÃ¶lgyi

Given a graph $G$ and a mapping $p : V (G) \to R^{d}$ , we say that the pair $(G, p)$ is a ( $d$ -dimensional) realization of $G$ . Two realizations $(G, p)$ and $(G, q)$ are equiva…