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

DOI10.1007/BF02759805MaRDI QIDQ2625477zbMATH OpenOpenAlexFDO

Authors 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

Cites work

• A decomposition theorem for partially ordered sets
• Axiomatic Treatment of Rank in Infinite Sets
• Choice functions and Tychonoff’s theorem
• scientific article; zbMATH DE number 3121291 (Why is no real title available?)
• scientific article; zbMATH DE number 3165195 (Why is no real title available?)
• scientific article; zbMATH DE number 3060538 (Why is no real title available?)
• scientific article; zbMATH DE number 3068973 (Why is no real title available?)
• Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
• The Marriage Problem

Cited in

(11)

• A note on Dilworth's theorem in the infinite case
• Another proof of Dilworth's decomposition theorem
• Another note on Dilworth's decomposition theorem.
• A proof of Menger's theorem
• On Dilworth's theorem in the infinite case
• Remarks on Dilworth's theorem in relation to transversal theory
• Two easy duality theorems for product partial orders
• Systems of representatives
• Dimension and matchings in comparability and incomparability graphs.
• On locally finite ordered rooted trees and their rooted subtrees
• Formal Proof of Dilworth's Theorem

This page was built for publication: A proof of Dilworth's decomposition theorem for partially ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2625477)