Packing the Boolean lattice with copies of a poset

Abstract

Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset )$ that covers almost every element of $2^{[n]}$: $\mathcal{P}$ might not cover the minimum and maximum of $2^{[n]}$, and at most $|P|-1$ additional points due to divisibility. In particular, if $|P|$ divides $2^n-2$, then the truncated Boolean lattice $2^{[n]}-\{\varnothing ,[n]\}$ can be partitioned into copies of $P$. This confirms a conjecture of Lonc from 1991.

arXiv comment24 pages, 2 figures

References in corpus (2)

• Decomposing the vertex set of a hypercube into isomorphic subgraphs
• Almost partitioning the hypercube into copies of a graph