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. © 1993 Academic Press, Inc.
Cite
CITATION STYLE
APA
Alon, N., & Füredi, Z. (1993). Covering the Cube by Affine Hyperplanes. European Journal of Combinatorics, 14(2), 79–83. https://doi.org/10.1006/eujc.1993.1011
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free