A proof of Dilworth's decomposition theorem for partially ordered sets

DOI10.1007/BF02759805zbMath0115.01702OpenAlexW1970064177MaRDI QIDQ2625477

Micha A. Perles

Publication date: 1963

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02759805

zbMATH Keywords

ordered sets, lattices

Related Items

On Dilworth's theorem in the infinite case, A note on Dilworth's theorem in the infinite case, Another note on Dilworth's decomposition theorem., Remarks on Dilworth's theorem in relation to transversal theory, Two easy duality theorems for product partial orders, Dimension and matchings in comparability and incomparability graphs., Another proof of Dilworth's decomposition theorem, Systems of representatives, A proof of Menger's theorem

Cites Work

• A decomposition theorem for partially ordered sets
• Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
• Axiomatic Treatment of Rank in Infinite Sets
• The Marriage Problem
• Choice functions and Tychonoff’s theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item