One can easily cover the vertices of the n-cube by 2 hyperplanes. Here it is proved that any set of hyperplanes that covers all the vertices of the n-cube but one contains at least n hyperplanes. We give a variety of proofs and generalizations.
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics