Combinatorics / CONCEPT
Local graphs and reciprocal double counting
Reciprocal incidence weights connect the local three-colored graphs of a finite triple family with its occupied pairs and nonempty common links. All vertex types are arbitrary finite types; there is no bound on degrees or class sizes.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS1
Common-link correspondence and mixed degree
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
- Disjoint-union uniqueness and intersecting linksstructural-affinity · Closed
- Exact stars at a marked packetstructural-affinity · Closed
- Local graphs and owned triangle rowsstructural-affinity · Closed
- Mixed vertices and actual triangle packetsstructural-affinity · Closed
- Ownership at a marked exchangestructural-affinity · Closed
- Payment for marked triangle rowsstructural-affinity · Closed
- Reciprocal estimates at the outer mixed countsstructural-affinity · Closed
- Reciprocal estimates for singleton color leavesstructural-affinity · Closed
- The exact triple forcing thresholdstructural-affinity · Closed
- The outer mixed-count obstructionstructural-affinity · Closed
- Three-color incidence and population reductionstructural-affinity · Closed
- Three-color reciprocal inequalitystructural-affinity · Closed
- Unordered wedges and four-edge common linksstructural-affinity · Closed
- Weighted induced deletionstructural-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