Improved bounds on the partitioning of the Boolean lattice into chains of equal size.

DOI10.1016/j.disc.2015.08.025zbMath1325.06007OpenAlexW1826017610MaRDI QIDQ501073

István Tomon

Publication date: 8 October 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.08.025

zbMATH Keywords

Boolean latticeschain partitionsFüredi conjectureGriggs conjecturepower sets of posets

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorics of partially ordered sets (06A07) Structure theory of Boolean algebras (06E05)

Related Items (5)

Partitioning the Boolean lattice into copies of a poset ⋮ Decompositions of the Boolean lattice into rank-symmetric chains. ⋮ Tiling the Boolean lattice with copies of a poset ⋮ Almost tiling of the Boolean lattice with copies of a poset ⋮ Packing the Boolean lattice with copies of a poset

Cites Work

• Unnamed Item
• Unnamed Item
• Partitioning Boolean lattices into chains of subsets
• Problems on chain partitions
• Chain partitions of products of two chains
• Partitioning the Boolean lattice into chains of large minimum size
• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
• On a conjecture of Füredi.

This page was built for publication: Improved bounds on the partitioning of the Boolean lattice into chains of equal size.