Partitioning the Boolean lattice into chains of large minimum size

DOI10.1006/jcta.2001.3197zbMath0996.06005OpenAlexW2059291929MaRDI QIDQ1604571

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

Publication date: 4 July 2002

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.2001.3197

zbMATH Keywords

Boolean latticenormalized matching propertychain decomposition

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

Related Items

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 ⋮ 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. ⋮ Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning Boolean lattices into chains of subsets
• Saturated chains of subsets and a random walk
• Problems on chain partitions
• Proof of a conjecture on partitions of a Boolean lattice
• The morphology of partially ordered sets
• Strong versions of Sperner's theorem
• Matchings, cutsets, and chain partitions in graded posets
• Sufficient Conditions for a Symmetric Chain Order
• Normalized Matching in Direct Products of Partial Orders