Arith / CONCEPT
Four-Message Tree Rigidity
Four-message cut capacities force an arbitrary labelled binary tree to have two peeling spines.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS1
Arbitrary Leaf Labels
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
- Balanced Interval Treesstructural-affinity · Closed
- Complete Messages on Binary Treesstructural-affinity · Closed
- First Rejection Across Arbitrary Window Cutsstructural-affinity · Closed
- Garbled Posterior and Scalar Root Riskstructural-affinity · Closed
- Scalar Softmax Trees and a Three-Class Obstructionstructural-affinity · Closed
- Shared Completion and First Rejectionstructural-affinity · Closed
- Tree Peak and Height Frontierstructural-affinity · Closed
- Two-State Profile Mass for Every Window Cutstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance