On partitions of discrete boxes

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

doi:10.1016/S0012-365X(02)00428-4

On partitions of discrete boxes

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

Research output: Contribution to journal › Conference article › peer-review

11 Scopus citations

Abstract

We prove that any partition of an n-dimensional discrete box into nontrivial sub-boxes must consist of at least 2ⁿ 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	https://doi.org/10.1016/S0012-365X(02)00428-4
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

Access to Document

10.1016/S0012-365X(02)00428-4

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

Cite this

@article{48956f62f59644b19110e4bf0fc4d07a,

title = "On partitions of discrete boxes",

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.",

author = "Noga Alon and Tom Bohman and Ron Holzman and Kleitman, {Daniel J.}",

year = "2002",

month = nov,

day = "28",

doi = "10.1016/S0012-365X(02)00428-4",

language = "English (US)",

volume = "257",

pages = "255--258",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "2-3",

note = "Kleitman and Combinatorics: A Celebration ; Conference date: 16-08-1990 Through 18-08-1990",

}

TY - JOUR

T1 - On partitions of discrete boxes

AU - Alon, Noga

AU - Bohman, Tom

AU - Holzman, Ron

AU - Kleitman, Daniel J.

PY - 2002/11/28

Y1 - 2002/11/28

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=31244434968&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=31244434968&partnerID=8YFLogxK

U2 - 10.1016/S0012-365X(02)00428-4

DO - 10.1016/S0012-365X(02)00428-4

M3 - Conference article

AN - SCOPUS:31244434968

VL - 257

SP - 255

EP - 258

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 2-3

T2 - Kleitman and Combinatorics: A Celebration

Y2 - 16 August 1990 through 18 August 1990

ER -