Almost tiling of the Boolean lattice with copies of a poset

István Tomon

Let $P$ be a partially ordered set. If the Boolean lattice $(2^{[n]},\subset )$ can be partitioned into copies of $P$ for some positive integer $n$, then $P$ must satisfy the follow…