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

DOI10.1016/J.DISC.2015.08.025zbMATH Open1325.06007OpenAlexW1826017610MaRDI QIDQ501073FDOQ501073

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

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

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)

Cites Work

• Title not available (Why is that?)
• 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.
• Title not available (Why is that?)

Cited In (12)

• Partitioning the Boolean lattice into chains of large minimum size
• Decompositions of the Boolean lattice into rank-symmetric chains.
• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
• Partitioning the Boolean lattice into copies of a poset
• Packing the Boolean lattice with copies of a poset
• Partitioning Boolean lattices into antichains
• A new matching property for posets and existence of disjoint chains
• Title not available (Why is that?)
• Tiling the Boolean lattice with copies of a poset
• Almost tiling of the Boolean lattice with copies of a poset
• Title not available (Why is that?)
• Partitioning Boolean lattices into chains of subsets

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)