Partitioning Boolean lattices into chains of subsets
From MaRDI portal
Recommendations
- Partitioning Boolean lattices into antichains
- Partitioning the Boolean lattice into chains of large minimum size
- Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
- scientific article; zbMATH DE number 1934409
- Partitions of large Boolean lattices
- Partitions of a finite Boolean lattice into intervals
- Partitioning the Boolean lattice into copies of a poset
- Improved bounds on the partitioning of the Boolean lattice into chains of equal size.
- scientific article; zbMATH DE number 3557853
- Proof of a conjecture on partitions of a Boolean lattice
Cited in
(16)- Partitioning the Boolean lattice into chains of large minimum size
- Decompositions of the Boolean lattice into rank-symmetric chains.
- Partitions of large Boolean lattices
- Partitioning the Boolean lattice into copies of a poset
- Proof of a conjecture on partitions of a Boolean lattice
- scientific article; zbMATH DE number 1934409 (Why is no real title available?)
- Methods for nesting rank 3 normalized matching rank-unimodal posets
- On Collections of Subsets Containing No 4-Member Boolean Algebra
- Improved bounds on the partitioning of the Boolean lattice into chains of equal size.
- Four-element generating sets of partition lattices and their direct products
- Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4- chains
- Reaping numbers and operations on Boolean algebras
- Problems on chain partitions
- Venn diagrams and symmetric chain decompositions in the Boolean lattice
- scientific article; zbMATH DE number 427816 (Why is no real title available?)
- Chain partitions of products of two chains
This page was built for publication: Partitioning Boolean lattices into chains of subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094437)
