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.
Original language | English (US) |
---|---|
Pages (from-to) | 255-258 |
Number of pages | 4 |
Journal | Discrete Mathematics |
Volume | 257 |
Issue number | 2-3 |
DOIs | |
State | Published - Nov 28 2002 |
Externally published | Yes |
Event | Kleitman and Combinatorics: A Celebration - Cambridge, MA, United States Duration: Aug 16 1990 → Aug 18 1990 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics