SHORT PROOF OF THE EXISTENCE OF K-SATURATED PARTITIONS OF PARTIALLY ORDERED SETS

被引:35
作者
SAKS, M
机构
[1] Department of Mathematics, Massachusetts Institute of Technology, Cambridge
关键词
D O I
10.1016/0001-8708(79)90010-0
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The theorem of Greene and Kleitman concerning the existence of k-saturated partitions for any partially ordered set P is proved by applying Dilworth's theorem to the product partial order of P with a chain of length k. © 1979.
引用
收藏
页码:207 / 211
页数:5
相关论文
共 5 条
[1]   A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS [J].
DILWORTH, RP .
ANNALS OF MATHEMATICS, 1950, 51 (01) :161-166
[2]   SOME PARTITIONS ASSOCIATED WITH A PARTIALLY ORDERED SET [J].
GREENE, C .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1976, 20 (01) :69-79
[3]   STRUCTURE OF SPERNER K-FAMILIES [J].
GREENE, C ;
KLEITMAN, DJ .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1976, 20 (01) :41-68
[4]   PARTITIONS OF A PARTIALLY ORDERED SET [J].
HOFFMAN, AJ ;
SCHWARTZ, DE .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1977, 23 (01) :3-13
[5]  
MIRSKY L, 1971, TRANSVERSAL THEORY, pCH3