Combinatorics / CONCEPT
Nonbacktracking Leaf Walks Exhaust Their Components
An actual nonempty walk between leaves in a finite graph of degree at most two, with no immediate backtracking, is the entire simple path component.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES1
PROOF DEPTH0
DOCUMENT LINKS0
A Nonbacktracking Walk from a Leaf Is Simple
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Actual J2 Complete Circle Rowsstructural-affinity · Closed
- Actual J2 Marked Edges in One F2 Hamilton Witnessstructural-affinity · Closed
- Actual J2 Seam Coordinatesstructural-affinity · Closed
- Actual Native F2 Edge Inventorystructural-affinity · Closed
- Actual Native J2 Marked Portsstructural-affinity · Closed
- Closed Actual F2 Native Edge Classificationstructural-affinity · Closed
- Literal F2 Cut Generators and Endpoint Labelsstructural-affinity · Closed
- The Actual F2 Six-Cut Graphstructural-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