  Let $P$ be a poset of size $2^k$ that has a greatest and a least element. We
prove that, for sufficiently large $n$, the Boolean lattice $2^{[n]}$ can be
partitioned into copies of $P$. This resolves a conjecture of Lonc.

Combinatorics