Combinatorics / CONCEPT
Simple cycles from disjoint path blocks
A cyclic sequence of internally simple, mutually disjoint path blocks gives a simple cycle. Its length counts every block vertex once, including the attachment edge following each block.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES1
PROOF DEPTH0
DOCUMENT LINKS0
Cyclic gluing of simple paths
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
- Averaging the two orientation certificatesstructural-affinity · Closed
- Parametric Garcia affine replacement infrastructurestructural-affinity · Closed
- The p = 29 orientation instances have no solutionstructural-affinity · Closed
- The p = 31 orientation instances have no solutionstructural-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