Combinatorics / CONCEPT
Graph counts in the common reservoir
Actual rainbow two-edge choices and deterministic predecessor sets are counted on one common reservoir outcome.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS0
Rainbow base choices
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- A robust random rainbow connectorstructural-affinity · Closed
- Deterministic Rainbow Two-Edge Choicesstructural-affinity · Closed
- Early Robust Layers with the Original Vertex Countstructural-affinity · Closed
- Mean-sensitive finite-colour concentrationstructural-affinity · Closed
- Rainbow Rank Descent with a Reserved Final Edgestructural-affinity · Closed
- Star counts in the common reservoirstructural-affinity · Closed
- The common reservoir probability blockstructural-affinity · Closed
- Vertex and literal-colour triple reservoirsstructural-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