Combinatorics / CONCEPT
Sahbi's hypercube sub-quorum conjecture
For every Boolean cube of dimension at least two, the largest number of colors in a sub-quorum coloring is exactly one parity class, namely two to the power n-1.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS1
The exact value in every dimension at least two
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
- Constrained harmonic optimizationstructural-affinity · Closed
- Counting legal-word toggle edges by deletionstructural-affinity · Closed
- Degrees and the sharp count bound for legal wordsstructural-affinity · Closed
- Induced subcubes of the Boolean hypercubestructural-affinity · Closed
- Quantum twins and neighbourhood separationstructural-affinity · Closed
- RRO Tail Linear-Length Setsstructural-affinity · Closed
- The Boolean hypercube and its edge countstructural-affinity · Closed
- The size distribution of nonadjacent supportsstructural-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