Combinatorics / CONCEPT
Deterministic Rainbow Two-Edge Choices
Repeated-colour two-edge choices have sparse exceptional endpoints; the genuine rainbow choices split into three classes using disjoint tagged vertex and colour coordinates.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH1
DOCUMENT LINKS0
Total Repeated-Colour Endpoint Mass
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 Good Triple from a Two-Vertex Cutstructural-affinity · Closed
- A nearly empty Cartesian layerstructural-affinity · Closed
- A robust random rainbow connectorstructural-affinity · Closed
- Characterizing well-covered Cayley squaresstructural-affinity · Closed
- Clique and odd-cycle surgerystructural-affinity · Closed
- Clique color extensionsstructural-affinity · Closed
- Coloring extensions and degree reductionstructural-affinity · Closed
- Coloring Hereditarily Sparse Graphsstructural-affinity · Closed
- Components and Vertex Cutsstructural-affinity · Closed
- Early Robust Layers with the Original Vertex Countstructural-affinity · Closed
- Graph counts in the common reservoirstructural-affinity · Closed
- Greedy Coloring and Vertex Extensionsstructural-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
- Subcubic Brooks Theoremstructural-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