Pages that link to "Item:Q1182036"
From MaRDI portal
The following pages link to Proof of a conjecture on partitions of a Boolean lattice (Q1182036):
Displaying 18 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)
- Partitioning Boolean lattices into chains of subsets (Q1094437) (← links)
- Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions (Q1176724) (← links)
- Chain partitions of products of two chains (Q1284475) (← links)
- Partitions of large Boolean lattices (Q1332423) (← links)
- Partitioning the Boolean lattice into chains of large minimum size (Q1604571) (← links)
- Partitioning the Boolean lattice into copies of a poset (Q1621412) (← links)
- Tiling the Boolean lattice with copies of a poset (Q1689970) (← links)
- Almost tiling of the Boolean lattice with copies of a poset (Q1700806) (← links)
- Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size (Q1867287) (← links)
- A new matching property for posets and existence of disjoint chains (Q1881683) (← links)
- Decompositions of the Boolean lattice into rank-symmetric chains. (Q2629495) (← links)
- A note on complete partitions in boolean algebras (Q3358783) (← links)
- (Q3818369) (← links)
- Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices (Q5878469) (← links)
- Chain partitions of ordered sets (Q5917347) (← links)