Almost tiling of the Boolean lattice with copies of a poset (Q1700806)

Summary: 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 following two trivial conditions: (1) the size of \(P\) is a power of 2, (2) \(P\) has a unique maximal and minimal element. Resolving a conjecture of \textit{Z. Lonc} [Order 8, No. 1, 17--27 (1991; Zbl 0736.06018)], it was shown by \textit{V. Gruslys} et al. [``Partitioning the Boolean lattice into copies of a poset'', Preprint, \url{arXiv:1609.02520}] that these conditions are sufficient as well. In this paper, we show that if \(P\) only satisfies condition (2), we can still almost partition \(2^{[n]}\) into copies of \(P\). We prove that if \(P\) has a unique maximal and minimal element, then there exists a constant \(c=c(P)\) such that all but at most \(c\) elements of \(2^{[n]}\) can be covered by disjoint copies of \(P\).