Combinatorics / CONCEPT
Fifteen-vertex separation and the fourteen-vertex bound
Let H be a finite family of subsets of an n-element vertex type. Under DUF, complete blocks with different centers have at most one vertex in each side-intersection cell, and the four cells cannot all be occupied. Under the additional cap of at most four neighbors per ground pair, these blocks are whole link components and satisfy the center and component separation bounds. Three-uniformity is assumed only for the final counting bound.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH5
DOCUMENT LINKS1
At most one vertex per intersection cell
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- A cone with a linear remainderstructural-affinity · Closed
- Charging saturated link componentsstructural-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
- Unordered wedges and four-edge common linksstructural-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