Pages that link to "Item:Q1621412"
From MaRDI portal
The following pages link to Partitioning the Boolean lattice into copies of a poset (Q1621412):
Displaying 14 items.
- Improved bounds on the partitioning of the Boolean lattice into chains of equal size. (Q501073) (← links)
- Incomparable copies of a poset in the Boolean lattice. (Q890018) (← links)
- Partitioning Boolean lattices into chains of subsets (Q1094437) (← links)
- Partitioning the complement of a simplex in \(PG(e,q^{d+1})\) into copies of PG(d,q) (Q1106465) (← links)
- Proof of a conjecture on partitions of a Boolean lattice (Q1182036) (← links)
- Partitions of large Boolean lattices (Q1332423) (← 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)
- A new matching property for posets and existence of disjoint chains (Q1881683) (← links)
- Partitioning the vertices of a torus into isomorphic subgraphs (Q2174951) (← links)
- On orthogonal symmetric chain decompositions (Q2325764) (← links)
- Packing the Boolean lattice with copies of a poset (Q3296748) (← links)
- TILING WITH PUNCTURED INTERVALS (Q4962532) (← links)
- On orthogonal symmetric chain decompositions (Q6621189) (← links)