Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.06246

On rigidity properties of unit-distance graphs

Sean Dewar·Georg Grasegger·Alison La Porta·Jan Legerský·Anthony Nixon
View original source ↗Read source document ↗Export metadata ↓

Abstract

A unit-distance graph is a graph which admits a realisation in Euclidean space in which every edge has unit length. Imposing further geometric conditions on the non-edges gives a family of natural subclasses. Requiring that no two vertices lie at distance less than one gives penny and marble graphs: the contact graphs of collections of equal radii $d$-dimensional spheres with non-overlapping interiors for $d=2,3$. Requiring instead that the straight-line drawing in the plane be non-crossing gives matchstick graphs. Since any motion of a realisation must preserve these extra conditions, the rigidity and flexibility properties of the resulting frameworks differ from those of classical bar-joint rigidity theory. In this note we analyse various rigidity problems for penny and marble graphs, matchstick graphs and unit-distance graphs. In particular we answer a recent open problem on penny and marble graph rigidity and establish a link between penny graphs and the concept of NAC-colourings.

Explore related subjects

math.COmath.MG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sean Dewar, Georg Grasegger, Alison La Porta, Jan Legerský, Anthony Nixon. 2026-10-05. On rigidity properties of unit-distance graphs. https://arxiv.org/abs/2610.06246

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Hamilton cycles in generalized dihedral Cayley graphs and digraphs

We prove that every connected Cayley digraph on a generalized dihedral group of order at least $4$ has a directed Hamilton cycle. In particular, this confirms a conjecture of Holsztyński and Strube from 1978 for dihedral groups. The key new ingredient is a three-fold sumset covering theorem for the terminal coordinates of Hamilton paths in cubic Haar graphs over abelian groups of odd order, with connection sets minimal subject to connectivity.

math.CO↗
arXiv2026

Some multidimensional Rogers--Ramanujan type identities

With the help of the contour integral method, we derive a parametric reduction formula that transforms a double series into a single series. This formula recovers two results of Uncu and Zudilin as well as two results of Cao and Wang, and it is also connected with an identity due to Berkovich and Warnaar. In addition, we obtain several triple-sum generalizations of Cao and Wang's formulas. As applications, we present a number of multidimensional Rogers--Ramanujan type identities, both with and without parameters.

math.CO↗
arXiv2026

Interaction between skew-representability, tensor products, extension properties, and rank inequalities

Skew-representable matroids form a fundamental class in matroid theory, bridging combinatorics and linear algebra. They play an important role in areas such as coding theory, optimization, and combinatorial geometry, where linear structure is crucial for both theoretical insights and algorithmic applications. Since skew-representability is undecidable even for rank-3 matroids, structural characterizations and explicit certificates of non-skew-representability are particularly interesting. In this paper, we introduce an approach to studying skew-representability and structural properties of matroids and polymatroid functions via tensor products. We characterize skew-representable matroids, as well as matroids representable over skew fields of a prescribed characteristic, in terms of iterated tensor products. In particular, a connected matroid is non-skew-representable if and only if, for some positive integer $k$, no $k$-fold iterated tensor product with $U_{2,3}$ exists. Thus, non-skew-representability admits a finite, computably verifiable matroid-theoretic obstruction; an analogous statement holds when the characteristic is prescribed. We also prove that every rank-3 matroid admits a tensor product with every uniform matroid and give a construction yielding the unique freest tensor product in this setting. Finally, as an application of the tensor product framework, we give a new proof of Ingleton's inequality and, more importantly, derive the first known linear rank inequality for folded skew-representable matroids that does not follow from the common information property.

math.CO↗