Combinatorics / CONCEPT
Reversible classification of all labelled subsets
Reversible classification of all labelled subsets
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH4
DOCUMENT LINKS0
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Actual maximal independent subsets of finite pathsstructural-affinity · Closed
- Classification by an apex and an opposite labelstructural-affinity · Closed
- Critical Vertices and Private Neighboursstructural-affinity · Closed
- From actual graph subsets to actual path subsetsstructural-affinity · Closed
- Path endpoints and the original restricted familystructural-affinity · Closed
- Real-root configurations of book domination polynomialsstructural-affinity · Closed
- The complete formal generating seriesstructural-affinity · Closed
- Trapezohedral minimal dominationstructural-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