Pages that link to "Item:Q501073"

The following pages link to Improved bounds on the partitioning of the Boolean lattice into chains of equal size. (Q501073):

Displaying 13 items.

• Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4- chains (Q805617) (← links)
• Partitioning Boolean lattices into chains of subsets (Q1094437) (← 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 Boolean lattices into antichains (Q1861242) (← 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)
• Packing the Boolean lattice with copies of a poset (Q3296748) (← links)
• (Q3722551) (← links)