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

DOI10.1016/J.DISC.2015.08.025MaRDI QIDQ501073zbMATH OpenOpenAlexFDO

Authors 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 partitionsGriggs conjecturepower sets of posetsFüredi conjecture

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1934409
• Proof of a conjecture on partitions of a Boolean lattice
• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
• Partitioning the Boolean lattice into copies of a poset
• Partitioning the Boolean lattice into chains of large minimum size

Cites work

• scientific article; zbMATH DE number 3974960 (Why is no real title available?)
• scientific article; zbMATH DE number 1934409 (Why is no real title available?)
• Chain partitions of products of two chains
• On a conjecture of Füredi.
• Partitioning Boolean lattices into chains of subsets
• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
• Partitioning the Boolean lattice into chains of large minimum size
• Problems on chain partitions

Cited in

(12)

• Tiling the Boolean lattice with copies of a poset
• A new matching property for posets and existence of disjoint chains
• Almost tiling of the Boolean lattice with copies of a poset
• Decompositions of the Boolean lattice into rank-symmetric chains.
• scientific article; zbMATH DE number 1934409 (Why is no real title available?)
• Partitioning Boolean lattices into antichains
• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
• Partitioning the Boolean lattice into chains of large minimum size
• Partitioning the Boolean lattice into copies of a poset
• scientific article; zbMATH DE number 3952833 (Why is no real title available?)
• Partitioning Boolean lattices into chains of subsets
• Packing the Boolean lattice with copies of a poset

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501073)