Partitioning the Boolean lattice into copies of a poset

JOURNAL OF COMBINATORIAL THEORY SERIES A

卷:161

Article

Gruslys, Vytautas¹  Leader, Imre¹  Tomon, Istvan¹ 

[1] Univ Cambridge, Dept Pure Math & Math Stat, Wilberforce Rd, Cambridge CB3 0WA, England

关键词: Posets;    Boolean lattice;    Packings and tilings;    Lonc's conjecture;   

DOI  :  10.1016/j.jcta.2018.07.003

来源: Elsevier

【 摘 要 】

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. 2018 Published by Elsevier Inc.

【 授权许可】

Free