Decompositions of the Boolean lattice into rank-symmetric chains.

zbMath1345.06002arXiv1509.07346MaRDI QIDQ2629495

István Tomon

Publication date: 6 July 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.07346

zbMATH Keywords

Boolean latticesFüredi conjecturechain decompositionsnumbers of symmetric chain partitions

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorics of partially ordered sets (06A07) Structure theory of Boolean algebras (06E05)

Related Items (1)

Uniform chain decompositions and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds on the partitioning of the Boolean lattice into chains of equal size.
• Some remarks on normalized matching
• The necklace poset is a symmetric chain order
• Proof of a conjecture on partitions of a Boolean lattice
• Strong versions of Sperner's theorem
• Partitioning the Boolean lattice into chains of large minimum size
• Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size
• On a conjecture of Füredi.
• On a lemma of Littlewood and Offord on the distribution of certain sums
• A decomposition theorem for partially ordered sets
• Sufficient Conditions for a Symmetric Chain Order

This page was built for publication: Decompositions of the Boolean lattice into rank-symmetric chains.