论文信息 - On partitions of a partially ordered set - 字舞流文

On partitions of a partially ordered set

Abstract Using linear programming we prove a generalization of Greene and Kleitman's generalization of Dilworth's theorem on the decomposition of a partially ordered set into chains.

Alan J. Hoffman | D. E. Schwartz | A. Hoffman | D. E. Schwartz

[1] Daniel J. Kleitman,et al. Strong Versions of Sperner's Theorem , 1976, J. Comb. Theory, Ser. A.

[2] A. J. Hoffman,et al. 11. Dilworth’s Theorem on Partially Ordered Sets , 1957 .

[3] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .

[4] D. R. Fulkerson. Note on Dilworth’s decomposition theorem for partially ordered sets , 1956 .

[5] Alan J. Hoffman,et al. A generalization of max flow—min cut , 1974, Math. Program..

[6] Curtis Greene. Some Partitions Associated with a Partially Ordered Set , 1976, J. Comb. Theory, Ser. A.

[7] D. R. Fulkerson,et al. MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE , 1954 .