Combinatorics / CONCEPT
The Boolean hypercube and its edge count
The Boolean hypercube of dimension n is regular of degree n and therefore carries n times two to the power n minus one edges.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES5
PROOF DEPTH0
DOCUMENT LINKS1
Regularity of degree n
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
- Degrees and the sharp count bound for legal wordstruth-dependency · Closed
- Induced subcubes of the Boolean hypercubetruth-dependency · Closed
- Quantum twins and neighbourhood separationtruth-dependency · Closed
- RRO Tail Linear-Length Setstruth-dependency · Closed
- Sahbi's hypercube sub-quorum conjecturetruth-dependency · Closed
RELATED KNOWLEDGE
Structural connections
- Capacity Box One-Bit Rigiditystructural-affinity · Closed
- Counting legal-word toggle edges by deletionstructural-affinity · Closed
- Degrees and the sharp count bound for legal wordsstructural-affinity · Closed
- Forbidden Neighbour Determinantstructural-affinity · Closed
- Induced subcubes of the Boolean hypercubestructural-affinity · Closed
- Quantum twins and neighbourhood separationstructural-affinity · Closed
- RRO Tail Linear-Length Setsstructural-affinity · Closed
- Sahbi's hypercube sub-quorum conjecturestructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance