Combinatorics / CONCEPT
The outer mixed-count obstruction
For a finite properly three-colored graph with mixed degree two, potential below two at mixed count zero, one, or at least six forces a unique mixed vertex and an adjacent singleton-color leaf.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS1
Recovering the exceptional geometry
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
- Actual deletion and global balancestructural-affinity · Closed
- Local graphs and reciprocal double countingstructural-affinity · Closed
- Payment for marked triangle rowsstructural-affinity · Closed
- Reciprocal estimates at the outer mixed countsstructural-affinity · Closed
- Small mixed graph inequalitystructural-affinity · Closed
- Small mixed-population certificatestructural-affinity · Closed
- The exact triple forcing thresholdstructural-affinity · Closed
- Three-color reciprocal inequalitystructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance