Combinatorics / CONCEPT
Spanning cycles in semicomplete directed relations
Spanning cycles in semicomplete directed relations
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES1
PROOF DEPTH0
DOCUMENT LINKS0
A change of orientation gives an insertion edge
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
- Disjoint minimal zero supports admit a Good orderingstructural-affinity · Closed
- Exact Boolean coverage descent at a private pairstructural-affinity · Closed
- Free rotation counts of original-label ordersstructural-affinity · Closed
- Original incidence and positive component chargestructural-affinity · Closed
- Original port incidence and directed geometrystructural-affinity · Closed
- Original-coordinate port cycles and avoiding wordsstructural-affinity · Closed
- Two Colours on Original Multigraph Starsstructural-affinity · Closed
- Zero total connects circular arcs to actual Good intervalsstructural-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