Partitioning the Boolean lattice into chains of large minimum size

DOI10.1006/JCTA.2001.3197zbMATH Open0996.06005OpenAlexW2059291929MaRDI QIDQ1604571FDOQ1604571

Authors: Tim Hsu, Mark J. Logan, Christopher Towse, 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

Recommendations

• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
• Decompositions of the Boolean lattice into rank-symmetric chains.
• scientific article; zbMATH DE number 1934409
• Improved bounds on the partitioning of the Boolean lattice into chains of equal size.
• On a conjecture of Füredi.

zbMATH Keywords

Boolean latticenormalized matching propertychain decomposition

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

Cites Work

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

Cited In (13)

• Decompositions of the Boolean lattice into rank-symmetric chains.
• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
• Partitioning the Boolean lattice into copies of a poset
• Partitioning Boolean lattices into antichains
• Long symmetric chains in the Boolean lattice
• Uniform chain decompositions and applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Methods for nesting rank 3 normalized matching rank-unimodal posets
• Improved bounds on the partitioning of the Boolean lattice into chains of equal size.
• The generalized Füredi conjecture holds for finite linear lattices
• Partitioning Boolean lattices into chains of subsets
• On a conjecture of Füredi.

This page was built for publication: Partitioning the Boolean lattice into chains of large minimum size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1604571)