Name
Abstract | ||
|---|---|---|
We prove that any partition of an n-dimensional discrete box into nontrivial sub-boxes must consist of at least 2n sub-boxes, and consider some extensions of this theorem. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(02)00428-4 | Discrete Mathematics |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Automated theorem proving,Hypergraph,Graph product,Partition (number theory),Mathematics | Journal | 257 |
Issue | ISSN | Citations |
2-3 | 0012-365X | 7 |
PageRank | References | Authors |
0.89 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Noga Alon | 1 | 10468 | 1688.16 |
| Tom Bohman | 2 | 250 | 33.01 |
| Ron Holzman | 3 | 287 | 43.78 |
| Daniel J. Kleitman | 4 | 854 | 277.98 |