trureturingGitHub MATHEMATICAL ATLAS

Combinatorics / CONCEPT

Charging saturated link components

Let V be a finite vertex type and H a finite family of subsets of V. The DUF condition says that an unordered pair of disjoint members of H is uniquely determined by its union. Write N(p) for the vertices outside p that extend p to a member of H, and K(q) for the family of ground pairs p with q contained in N(p). The cap-four hypothesis requires card(N(p))<=4 for every ground pair p, including absent pairs.

Closed Authored exposition
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH5
DOCUMENT LINKS1
THEOREM

The common link of a center and an additional neighbor

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
The component correction identityThe component correctionidentityCharging saturated link componentsCharging saturated linkcomponents
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.