| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903675 | Journal of Combinatorial Theory, Series A | 2019 | 18 Pages |
Abstract
Let P be a poset of size 2k 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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Vytautas Gruslys, Imre Leader, István Tomon,