Pages that link to "Item:Q1604571"

The following pages link to Partitioning the Boolean lattice into chains of large minimum size (Q1604571):

Displaying 13 items.

• Improved bounds on the partitioning of the Boolean lattice into chains of equal size. (Q501073) (← 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 Boolean lattices into chains of subsets (Q1094437) (← links)
• Partitions of large Boolean lattices (Q1332423) (← links)
• Partitioning the Boolean lattice into copies of a poset (Q1621412) (← links)
• Partitioning Boolean lattices into antichains (Q1861242) (← links)
• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size (Q1867287) (← links)
• Long symmetric chains in the Boolean lattice (Q1919667) (← links)
• On a conjecture of Füredi. (Q2349954) (← links)
• Decompositions of the Boolean lattice into rank-symmetric chains. (Q2629495) (← links)
• (Q3739131) (← links)
• Uniform chain decompositions and applications (Q6074684) (← links)