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.
|Number of pages||4|
|State||Published - 28 Nov 2002|
|Event||Kleitman and Combinatorics: A Celebration - Cambridge, MA, United States|
Duration: 16 Aug 1990 → 18 Aug 1990