Combinatorics / CONCEPT
Safe nonedge repair by tight blockers
Finite simple graph counts, tight subsets, and exact Henneberg operations over arbitrary vertex types.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS0
The three-neighbor obstruction
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Frameworkstructural-affinity · Closed
- Henneberg preservation and reconstructionstructural-affinity · Closed
- HennebergRigiditystructural-affinity · Closed
- PlanarForwardstructural-affinity · Closed
- PlanarRowsstructural-affinity · Closed
- Sparsity and tight-set closurestructural-affinity · Closed
- The complete finite Henneberg characterizationstructural-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