Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4- chains (Q805617)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4204354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4- chains |
scientific article; zbMATH DE number 4204354 |
Statements
Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4- chains (English)
0 references
1991
0 references
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\).
0 references
partition
0 references
Boolean lattice
0 references
4-chains
0 references
0.8543152213096619
0 references
0.7651415467262268
0 references
0.7157695293426514
0 references
0.712955892086029
0 references
