Publisher
Springer Science and Business Media LLC
Reference9 articles.
1. de Bruijn N. G. and Erdös P. 1951, A colour problem for infinite graphs and, a problem in the theory of relations,Nederl. Akad. Wetensch. Proc. ser. A,54, 371–373.
2. Dantzig G. B. and Hoffman, A. J., 1956, Dilworth’s theorem on partially orders sets, Linear inequalities and related systems,Annals of Mathematics Studies No. 38, Princeton University Press, pp. 207–214.
3. Dilworth, R. P., 1950, A decomposition theorem for partially ordered sets,Ann. of Math. 51, 161–166.
4. Fulkerson, D. R., 1956, Note on Dilworth’s decomposition theorem for partially ordered sets,Proc. Amer. Math. Soc.,7, 701–702.
5. Gallai, T. and Milgram, A. N., 1960, Verallgemeinerung eines graphentheoretisch-Satzes von Rédei,Acta Sci. Math. (Szeged),21, 181–186.
Cited by
71 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On locally finite ordered rooted trees and their rooted subtrees;Discrete Applied Mathematics;2025-01
2. Plate Section;An Invitation to Combinatorics;2021-07-22
3. Index;An Invitation to Combinatorics;2021-07-22
4. Bibliography;An Invitation to Combinatorics;2021-07-22
5. Complete Solutions for Selected Problems;An Invitation to Combinatorics;2021-07-22