Combinatorics / CONCEPT
An obstruction to global coalition universality
The edgeless two-vertex graph has no global coalition realization, because every partition block has an actual coalition partner.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS0
The partition field
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
- A Dom-Path Longer Than the Jaco Graph Diameter Boundstructural-affinity · Closed
- Božović Conjecture 12: limited domination in Sierpiński graphsstructural-affinity · Closed
- Critical Vertices and Private Neighboursstructural-affinity · Closed
- Finite dominating-set averagesstructural-affinity · Closed
- Five paired coalition parts in the height-five binary treestructural-affinity · Closed
- Refutation of Annor Conjecture 14structural-affinity · Closed
- Regular Graph Covers and Dominationstructural-affinity · Closed
- The Koch-Narayan bipartite edge bound is falsestructural-affinity · Closed
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