Pages that link to "Item:Q1094437"
From MaRDI portal
The following pages link to Partitioning Boolean lattices into chains of subsets (Q1094437):
Displaying 14 items.
- Improved bounds on the partitioning of the Boolean lattice into chains of equal size. (Q501073) (← links)
- Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4- chains (Q805617) (← links)
- Methods for nesting rank 3 normalized matching rank-unimodal posets (Q1011490) (← links)
- Problems on chain partitions (Q1115891) (← links)
- Proof of a conjecture on partitions of a Boolean lattice (Q1182036) (← links)
- Chain partitions of products of two chains (Q1284475) (← links)
- Partitions of large Boolean lattices (Q1332423) (← links)
- Venn diagrams and symmetric chain decompositions in the Boolean lattice (Q1422140) (← links)
- Partitioning the Boolean lattice into chains of large minimum size (Q1604571) (← links)
- Partitioning the Boolean lattice into copies of a poset (Q1621412) (← links)
- Reaping numbers and operations on Boolean algebras (Q1966139) (← links)
- Decompositions of the Boolean lattice into rank-symmetric chains. (Q2629495) (← links)
- On Collections of Subsets Containing No 4-Member Boolean Algebra (Q5616180) (← links)
- Four-element generating sets of partition lattices and their direct products (Q5855794) (← links)
