Combinatorics / CONCEPT
Small mixed graph inequality
Every finite properly three-colored simple graph whose mixed vertices all have degree two and whose mixed population has size between two and five has reciprocal deletion potential at least two.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS1
Actual graph theorem
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 owned triangle rowsstructural-affinity · Closed
- Payment for marked triangle rowsstructural-affinity · Closed
- Reciprocal estimates at the outer mixed countsstructural-affinity · Closed
- Residual graphs after positive private deletionstructural-affinity · Closed
- Small mixed-population certificatestructural-affinity · Closed
- The exact triple forcing thresholdstructural-affinity · Closed
- The outer mixed-count obstructionstructural-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