Name
Abstract | ||
|---|---|---|
Alon and Furedi (1993) showed that the number of hyperplanes required to cover {0, 1}(n) \ {0} without covering 0 is n. We initiate the study of such exact hyperplane covers of the hypercube for other subsets of the hypercube. In particular, we provide exact solutions for covering {0, 1}(n) while missing up to four points and give asymptotic bounds in the general case. Several interesting questions are left open.(c) 2021 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/). |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.disc.2021.112490 | DISCRETE MATHEMATICS |
Keywords | DocType | Volume |
Hypercube, Intersection patterns, Hyperplanes, Exact covers | Journal | 344 |
Issue | ISSN | Citations |
9 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| James Aaronson | 1 | 0 | 0.34 |
| Carla Groenland | 2 | 0 | 0.34 |
| Andrzej Grzesik | 3 | 0 | 0.34 |
| Tom Johnston | 4 | 0 | 0.34 |
| Bartlomiej Kielak | 5 | 0 | 0.34 |