Partitioning the Boolean lattice into copies of a poset
classification
🧮 math.CO
keywords
booleancopieslatticeposetconjectureelementgreatestlarge
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.