Problems on chain partitions

DOI10.1016/0012-365X(88)90204-XzbMath0665.06003MaRDI QIDQ1115891

Jerrold R. Griggs

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

partitions of posets into chains

Mathematics Subject Classification ID

Partial orders, general (06A06)

Related Items (19)

Partitions of large Boolean lattices ⋮ Partitioning the Boolean lattice into copies of a poset ⋮ Uniform chain decompositions and applications ⋮ Tiling the Boolean lattice with copies of a poset ⋮ Almost tiling of the Boolean lattice with copies of a poset ⋮ On nested chain decompositions of normalized matching posets of rank 3 ⋮ Packing the Boolean lattice with copies of a poset ⋮ Proof of a conjecture on partitions of a Boolean lattice ⋮ Improved bounds on the partitioning of the Boolean lattice into chains of equal size. ⋮ Some remarks on nestings in the normalized matching posets of rank 3 ⋮ Methods for nesting rank 3 normalized matching rank-unimodal posets ⋮ Chain partitions of products of two chains ⋮ On orthogonal symmetric chain decompositions ⋮ Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems. ⋮ The strong Hall property and symmetric chain orders ⋮ Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4- chains ⋮ On a conjecture of Füredi. ⋮ Partitioning the Boolean lattice into chains of large minimum size ⋮ Partitioning the Boolean lattice into a minimal number of chains of relatively uniform size

Cites Work

• Quotients of Peck posets
• Recognition of order-preserving maps
• Partitioning Boolean lattices into chains of subsets
• Saturated chains of subsets and a random walk
• A partition of L(3,n) into saturated symmetric chains
• A symmetric chain decomposition of L(4,n)
• Strong versions of Sperner's theorem
• Sperner properties for groups and relations
• A decomposition theorem for partially ordered sets
• Morphisms for the strong Sperner property of Stanley and Griggs
• Counting common representatives and symmetric chain decompositions
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• Sufficient Conditions for a Symmetric Chain Order
• A variance method in combinatorial number theory
• The structure of Sperner k-families
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Problems on chain partitions