trureturingGitHub MATHEMATICAL ATLAS

Combinatorics / CONCEPT

Double-star grafting on arbitrary finite graphs

Attaching a six-vertex double star at each vertex of any nonempty finite simple graph adds four vertices per gadget to the dissociation maximum and gives exactly five sub-quorum colors per base vertex.

Closed Authored exposition
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS0
THEOREM

Exact induced degree-at-most-one maximum

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Two-independence and upper two-star formation differTwo-independence and upper two-star formation differDouble-star grafting on arbitrary finite graphsDouble-star grafting onarbitrary finite graphs
Proof dependencyStructural affinityDocument link

Certified topology / UPSTREAM

Prerequisites

Certified topology / DOWNSTREAM

Consequences

None recorded in this release.

RELATED KNOWLEDGE

Structural connections

Documents & exposition

None recorded in this release.

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.