On generic 3-rigidity of graphs
Combinatorics
2026-01-29 v5
Abstract
We give a necessary condition of generic 3 -rigidity of graphs relying on partitioning the edges into 3 subsets; such that each subset-pair gives a generically 2-rigid graph, either by themselves or after an appropriate edge-deletion. Notably, as pointed out by Dewar and Gallet, the condition is still not sufficient.
Keywords
Cite
@article{arxiv.2409.16741,
title = {On generic 3-rigidity of graphs},
author = {Tamás Baranyai},
journal= {arXiv preprint arXiv:2409.16741},
year = {2026}
}
Comments
As the original work was only partially correct, this is indicated