Combinatorics / CONCEPT
Every finite actual flag graph admits terminal leaf pruning
Every finite actual flag graph admits terminal leaf pruning
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH5
DOCUMENT LINKS0
A terminal chronology exists without a supplied pruning certificate
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
- Actual acyclic hair components admit binary-tree modelsstructural-affinity · Closed
- Actual flag incidence preserves Euler genusstructural-affinity · Closed
- Actual leaf pruning extracts singly attached ordinary hair treesstructural-affinity · Closed
- Actual subdivision and hair-tree graftingstructural-affinity · Closed
- Binary hair-tree grafts vanish in the actual Jacobi quotientstructural-affinity · Closed
- Chronological leaf deletion and component boundariesstructural-affinity · Closed
- The exact connected source grade embeds in the actual diagram quotientstructural-affinity · Closed
- The greatest anchor-protected pruning corestructural-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