On Dilworth's theorem in the infinite case

DOI10.1007/BF02759806zbMath0115.01703OpenAlexW1990565513WikidataQ56430247 ScholiaQ56430247MaRDI QIDQ2625478

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/bf02759806

zbMATH Keywords

ordered sets, lattices

Related Items

A note on Dilworth's theorem in the infinite case, Changing the Depth of an Ordered Set by Decomposition, A chain decomposition theorem, Removing the torsion from a unital group., Test groups and effect algebras, The chain covering number of a poset with no infinite antichains, On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders, Gallai-Milgram properties for infinite graphs, Utility representation of an incomplete preference relation, Some inequalities for partial orders, Infinite triangulated graphs, Systems of representatives, A bound for the Dilworth number

Cites Work

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