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
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS0
Exact induced degree-at-most-one maximum
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
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 archiveCertified provenance