Dániel Garamvölgyi

activity

20242026

most citedRigidity and reconstruction in matroids of highly connected graphs

1 citations · 1 across the 1 of their papers we have counts for

collaborators

5 papers

math.CO2026

Stable cuts, NAC-colourings and flexible realisations of graphs

Katie Clinch, DÃ¡niel GaramvÃ¶lgyi, John Haslegrave +3

A (2-dimensional) realisation of a graph $G$ is a pair $(G, p)$ , where $p$ maps the vertices of $G$ to $R^{2}$ . A realisation is flexible if it can be continuously deformed w…

math.CO2026★ 1 cited

Rigidity and reconstruction in matroids of highly connected graphs

DÃ¡niel GaramvÃ¶lgyi

A graph matroid family $M$ is a family of matroids $M (G)$ defined on the edge set of each finite graph $G$ in a compatible and isomorphism-invariant way. We say…

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

Towards the Proximity Conjecture on Group-Labeled Matroids

DÃ¡niel GaramvÃ¶lgyi, Ryuhei Mizutani, Taihei Oki +2

Consider a matroid $M$ whose ground set is equipped with a labeling to an abelian group. A basis of $M$ is called $F$ -avoiding if the sum of the labels of its elements is not in a…

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…