Covering the Cube by Affine Hyperplanes

Noga Alon; Zoltán Füredi

doi:10.1006/eujc.1993.1011

Covering the Cube by Affine Hyperplanes

Noga Alon, Zoltán Füredi

Research output: Contribution to journal › Article › peer-review

61 Scopus citations

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	https://doi.org/10.1006/eujc.1993.1011
State	Published - Mar 1993
Externally published	Yes

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics

Access to Document

10.1006/eujc.1993.1011

Cite this

@article{6436589bdede49b18d3d952201579da6,

title = "Covering the Cube by Affine Hyperplanes",

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.",

author = "Noga Alon and Zolt{\'a}n F{\"u}redi",

year = "1993",

month = mar,

doi = "10.1006/eujc.1993.1011",

language = "English (US)",

volume = "14",

pages = "79--83",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

number = "2",

}

TY - JOUR

T1 - Covering the Cube by Affine Hyperplanes

AU - Alon, Noga

AU - Füredi, Zoltán

PY - 1993/3

Y1 - 1993/3

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38249006949&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249006949&partnerID=8YFLogxK

U2 - 10.1006/eujc.1993.1011

DO - 10.1006/eujc.1993.1011

M3 - Article

AN - SCOPUS:38249006949

SN - 0195-6698

VL - 14

SP - 79

EP - 83

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

IS - 2

ER -

Covering the Cube by Affine Hyperplanes

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this