Pages that link to "Item:Q1867287"
From MaRDI portal
The following pages link to Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size (Q1867287):
Displayed 8 items.
- Improved bounds on the partitioning of the Boolean lattice into chains of equal size. (Q501073) (← links)
- On nested chain decompositions of normalized matching posets of rank 3 (Q634742) (← links)
- The generalized Füredi conjecture holds for finite linear lattices (Q856864) (← links)
- Methods for nesting rank 3 normalized matching rank-unimodal posets (Q1011490) (← links)
- Partitioning the Boolean lattice into copies of a poset (Q1621412) (← links)
- On a conjecture of Füredi. (Q2349954) (← links)
- Decompositions of the Boolean lattice into rank-symmetric chains. (Q2629495) (← links)
- Uniform chain decompositions and applications (Q6074684) (← links)