Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size

DOI10.1016/S0195-6698(02)00133-6zbMath1031.06003MaRDI QIDQ1867287

Tim Hsu, Mark J. Logan, Shahriar Shahriari, Christopher Towse

Publication date: 2 April 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Boolean latticechain decompositionsLYM propertynormalized matching propertyFüredi's problem

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

Related Items (8)

Partitioning the Boolean lattice into copies of a poset ⋮ Decompositions of the Boolean lattice into rank-symmetric chains. ⋮ The generalized Füredi conjecture holds for finite linear lattices ⋮ Uniform chain decompositions and applications ⋮ On nested chain decompositions of normalized matching posets of rank 3 ⋮ Improved bounds on the partitioning of the Boolean lattice into chains of equal size. ⋮ Methods for nesting rank 3 normalized matching rank-unimodal posets ⋮ On a conjecture of Füredi.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Problems on chain partitions
• Partitioning the Boolean lattice into chains of large minimum size
• Matchings, cutsets, and chain partitions in graded posets

This page was built for publication: Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size