Name
Abstract | ||
|---|---|---|
It is shown that the shadow of a Sperner family can cover 10 percent of the Boolean algebra. Whether this can be improved to (100 - o (1))% remains open. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1016/0012-365X(90)90229-B | Discrete Mathematics |
Keywords | Field | DocType |
incomparable center,sphere covering | Boolean function,Discrete mathematics,Shadow,Monotonic function,Combinatorics,Upper and lower bounds,Hamming distance,Boolean algebra,Sperner family,Hypercube,Mathematics | Journal |
Volume | Issue | ISSN |
83 | 1 | Discrete Mathematics |
Citations | PageRank | References |
3 | 0.49 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zoltán Füredi | 1 | 1237 | 233.60 |
| Jeff Kahn | 2 | 10 | 5.74 |
| Daniel J. Kleitman | 3 | 854 | 277.98 |