Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 79-83 |
| Number of pages | 5 |
| Journal | European Journal of Combinatorics |
| Volume | 14 |
| Issue number | 2 |
| DOIs | |
| State | Published - Mar 1993 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'Covering the Cube by Affine Hyperplanes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver