Incomparable copies of a poset in the Boolean lattice

Gyula O. H. Katona, Dániel T. Nagy

Let $B_n$ be the poset generated by the subsets of $[n]$ with the inclusion as relation and let $P$ be a finite poset. We want to embed $P$ into $B_n$ as many times as possible suc…