trureturingGitHub MATHEMATICAL ATLAS

Combinatorics / CONCEPT

Cutting Actual Graph Walks into Paths

Deleting a nonempty collection of actual Hamilton cycle edges yields exactly one path per deleted edge, with every vertex occurring once.

Closed Authored exposition
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES9
PROOF DEPTH0
DOCUMENT LINKS0
THEOREM

Literal Support and Edge Lists after Cutting a Path

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Cutting Actual Graph Walks into PathsCutting Actual Graph Walks intoPathsThe Actual F2 Six-Cut GraphThe Actual F2 Six-Cut GraphReordering and Joining Actual Cycle PiecesReordering and Joining ActualCycle PiecesEndpoint Pairs after Actual Joint ReplacementEndpoint Pairs after ActualJoint ReplacementActual Route InventoriesActual Route InventoriesActual Path Families Retain the Same Cycle InventoryActual Path Families Retain theSame Cycle InventoryCutting the Forced Prefix of an Actual Graph PathCutting the Forced Prefix of anActual Graph PathActual Endpoints of Hamilton Cycle SlicesActual Endpoints of HamiltonCycle SlicesTwo Ordered Cuts of an Actual Graph PathTwo Ordered Cuts of an ActualGraph PathSplicing Actual Paths around a RingSplicing Actual Paths around aRing
Proof dependencyStructural affinityDocument link

RELATED KNOWLEDGE

Structural connections

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 archive

Certified provenance

Exact release coordinate

Lean sourceResearch workspace
Status
Closed
Depth
0
Layer
D5/S3
Domain
Combinatorics
Node ID
D5/S3/Combinatorics/Graph/Walks/EdgeSlicing
Repository path
D5/S3/Combinatorics/Graph/Walks/EdgeSlicing.lean
Truth release
sha256:76a8db6a0f78609b1b9d4a959c8392f2752f2daaddc1930e046e34ce07d0f608
Source commit
b52262a023c4db9bb30a128ebfd80ea4ef4c1a53
Source tree
37a24ddf3b9983bdabf0acbfd9b32b06c35c28d3

Authority boundary

Dependency edges, status, and source coordinates come from the verified release and certified topology. Blueprint exposition is labeled separately. A fallback title carries no additional mathematical authority.