The following pages link to Problems on chain partitions (Q1115891):
Displayed 19 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)
- 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)
- Proof of a conjecture on partitions of a Boolean lattice (Q1182036) (← links)
- Chain partitions of products of two chains (Q1284475) (← links)
- The strong Hall property and symmetric chain orders (Q1301661) (← links)
- Partitions of large Boolean lattices (Q1332423) (← links)
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems. (Q1584467) (← 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)
- Some remarks on nestings in the normalized matching posets of rank 3 (Q2279681) (← links)
- On orthogonal symmetric chain decompositions (Q2325764) (← links)
- On a conjecture of Füredi. (Q2349954) (← links)
- Packing the Boolean lattice with copies of a poset (Q3296748) (← links)
- Uniform chain decompositions and applications (Q6074684) (← links)