trureturingGitHub MATHEMATICAL ATLAS

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 Authored exposition
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH5
DOCUMENT LINKS1
THEOREM

At most one vertex per intersection cell

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
The component correction identityThe component correctionidentityFifteen-vertex separation and the fourteen-vertex boundFifteen-vertex separation andthe fourteen-vertex bound
Proof dependencyStructural affinityDocument link

Certified topology / UPSTREAM

Prerequisites

Certified topology / DOWNSTREAM

Consequences

None recorded in this release.

RELATED KNOWLEDGE

Structural connections

Documents & exposition

Other authored & advisory relationships

None recorded in this release.

LIBRARY / RELEASE VERSIONS

Content history

Loading release versions...
Browse the archive

Certified provenance

Exact release coordinate

Authority boundary

Dependency edges, status, and source coordinates come from the verified release and certified topology. Blueprint exposition is labeled separately. A fallback title carries no additional mathematical authority.