Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4- chains

DOI10.1016/0012-365X(91)90358-9MaRDI QIDQ805617zbMATH OpenOpenAlexFDO

Authors Hazel Perfect

Publication date 1991

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(91)90358-9

zbMATH Keywords

4-chainsBoolean latticepartition

Mathematics Subject Classification ID

Partitions of sets (05A18) Structure theory of Boolean algebras (06E05)

Review text

The author describes an inclusion-preserving, one-to-one correspondence between the four element subsets of \(N_ 9=\{M\subseteq N_ 9:\;| M| \leq 3\}\setminus \{\emptyset,\{1\},\{1,2\},\{1,2,3\}\}.\) This result simplifies the proof of the theorem of \textit{J. R. Griggs}, \textit{R. K.-C. Yeh} and \textit{C. M. Grinstead} [Order 4, 65-67 (1987; Zbl 0631.06007)] a Boolean lattice \(B_ n\) can be partitioned into 4-chains if and only if \(n\leq 9\).

Recommendations

• Partitioning Boolean lattices into chains of subsets
• Proof of a conjecture on partitions of a Boolean lattice
• scientific article; zbMATH DE number 1934409
• Improved bounds on the partitioning of the Boolean lattice into chains of equal size.
• Partitions of large Boolean lattices

Cites work

• Choice mappings of certain classes of finite sets
• Lexicographic matching in Boolean algebras
• Partitioning Boolean lattices into chains of subsets
• Problems on chain partitions
• Recursive matching algorithms and linear orders on the subset lattice

This page was built for publication: Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4- chains

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