Partitioning the n-cube into sets with mutual distance 1

A. Blokhuis, K. Metsch, G.E. Moorhouse, R. Ahlswede, S. Bezrukov

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

We consider a problem mentioned in [1], which is in partitioning the n-cube in as many sets as possible, such that two different sets always have distance one.
Original languageEnglish
Pages (from-to)17-19
JournalApplied Mathematics Letters
Volume6
Issue number4
DOIs
Publication statusPublished - 1993

Fingerprint Dive into the research topics of 'Partitioning the n-cube into sets with mutual distance 1'. Together they form a unique fingerprint.

Cite this