trureturingGitHub MATHEMATICAL ATLAS

Combinatorics / CONCEPT

Every Ten-Vertex Set Has Boundary at Least Eight

Bounded gaps, the fourteen-column long-gap case, and deletion through an empty buffer give a uniform isoperimetric bound.

Closed Authored exposition
DIRECT PREREQUISITES18
DIRECT CONSEQUENCES1
PROOF DEPTH7
DOCUMENT LINKS1
THEOREM

The boundary bound for bounded support gaps

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Proof dependencyStructural affinityDocument link

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.