A counter-example to Baranyai's combinatorial characterisation for 3-rigidity
Combinatorics
2026-01-28 v1
Abstract
Recently Baranyai described a necessary combinatorial characterisation of graph rigidity for dimension 3. In this short note we provide a counter-example to the converse of the condition. Additionally, we provide an alternative proof to the Baranyai's necessary condition.
Cite
@article{arxiv.2601.19460,
title = {A counter-example to Baranyai's combinatorial characterisation for 3-rigidity},
author = {Sean Dewar},
journal= {arXiv preprint arXiv:2601.19460},
year = {2026}
}
Comments
8 pages