trureturingGitHub MATHEMATICAL ATLAS

Combinatorics / CONCEPT

Capacity ports and parity absorption

Every routing of a finite loopless capacity multigraph has literal terminal paths, exact typed terminal counts, and the parity absorption bound D ≥ 3q + 4b + 2c + o.

Closed Authored exposition
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES3
PROOF DEPTH0
DOCUMENT LINKS2
THEOREM

Full routing theorem

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Capacity ports and parity absorptionCapacity ports and parityabsorptionActual rectangular residuals and port absorptionActual rectangular residualsand port absorptionSaturated geometry of an even rectangleSaturated geometry of an evenrectangleSeparation and capacity absorptionSeparation and capacityabsorption
Proof dependencyStructural affinityDocument link

RELATED KNOWLEDGE

Structural connections

Documents & exposition

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/CapacityPortParityAbsorption
Repository path
D5/S3/Combinatorics/Graph/CapacityPortParityAbsorption.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.