Every 5-regular graph satisfying Maxwell's edge-count condition on all subgraphs is independent in the 3-dimensional rigidity matroid.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
5-regular graphs and the 3-dimensional rigidity matroid
Every 5-regular graph satisfying Maxwell's edge-count condition on all subgraphs is independent in the 3-dimensional rigidity matroid.