Combinatorics / CONCEPT
Unordered wedges and four-edge common links
Let H be a finite family of subsets of a finite vertex type. The definitions of tips and wedges apply to every such H. Under DUF and the cap of at most four neighbors per ground pair, two distinct edges in F(S) with card(S)=4 meet at a center. Their two remaining endpoints determine a four-edge common link. Recovering its center and leaves removes any overcounting.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS1
From a wedge to a common link
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 cone with a linear remainderstructural-affinity · Closed
- Charging saturated link componentsstructural-affinity · Closed
- Disjoint-union uniqueness and intersecting linksstructural-affinity · Closed
- Exact stars at a marked packetstructural-affinity · Closed
- Fifteen-vertex separation and the fourteen-vertex boundstructural-affinity · Closed
- Local graphs and reciprocal double countingstructural-affinity · Closed
- Ownership at a marked exchangestructural-affinity · Closed
- Reciprocal fibers and actual link componentsstructural-affinity · Closed
- The component correction identitystructural-affinity · Closed
- Two incidence counts and the codegree-four boundstructural-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