A PROOF OF DILWORTHS DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS

被引：24

作者：

PERLES, MA

机构：

来源：

关键词：

D O I：

10.1007/BF02759805

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：105 / &

共 9 条

[1]

BRUIJN NGD, 1951, NEDERL AKAD WETENS A, V54, P371

[2]

DANTZIG GB, 1956, 38 ANN MATH STUD, P207

[3] A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS [J].

DILWORTH, RP .

[4]

Fulkerson D.R., 1956, P AM MATH SOC, V7, P701, DOI DOI 10.2307/2033375

[5]

Gallai T., 1960, ACTA SCI MATH, V21, P181

[6] CHOICE FUNCTIONS AND TYCHONOFF THEOREM [J].

GOTTSCHALK, WH .

[7] THE MARRIAGE PROBLEM [J].

HALMOS, PR ;

VAUGHAN, HE .

[8]

KONIG D, 1950, THEORIE ENDLICHEN UN

[9] AXIOMATIC TREATMENT OF RANK IN INFINITE SETS [J].

RADO, R .

CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1949, 1 (04) :337-343