Document Type

Article

Publication Date

6-30-2008

Publication Title

The Electronic Journal of Combinatorics

Abstract

Answer in g a question of Cameron, Pretzel and Siemons proved that every integer partition of n >= 2(k + 3) (k + 1) can be reconstructed from its set of k-deletions. We describe a new reconstruction algorithm that lowers this bound to n >= k(2) + 2k and present examples showing that this bound is best possible.

Share

COinS