Combinatorics / CONCEPT
The complete finite Henneberg characterization
Let V be any finite vertex type in any universe and G a simple graph on V. The additive Laman counts characterize an actual finite list of legal Henneberg moves starting with K2. No embedding or geometric placement is required.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS0
Laman counts if and only if a finite legal history exists
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Frameworkstructural-affinity · Closed
- Henneberg preservation and reconstructionstructural-affinity · Closed
- HennebergRigiditystructural-affinity · Closed
- PlanarForwardstructural-affinity · Closed
- PlanarRowsstructural-affinity · Closed
- Real planar rigidity and spanning Laman graphsstructural-affinity · Closed
- Safe nonedge repair by tight blockersstructural-affinity · Closed
- TrivialMotionsstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance