On partitions of discrete boxes

Noga Alon, Tom Bohman, Ron Holzman, Daniel J. Kleitman

Research output: Contribution to journalConference article

11 Scopus citations


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 languageEnglish (US)
Pages (from-to)255-258
Number of pages4
JournalDiscrete Mathematics
Issue number2-3
StatePublished - Nov 28 2002
Externally publishedYes
EventKleitman and Combinatorics: A Celebration - Cambridge, MA, United States
Duration: Aug 16 1990Aug 18 1990

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'On partitions of discrete boxes'. Together they form a unique fingerprint.

  • Cite this

    Alon, N., Bohman, T., Holzman, R., & Kleitman, D. J. (2002). On partitions of discrete boxes. Discrete Mathematics, 257(2-3), 255-258. https://doi.org/10.1016/S0012-365X(02)00428-4