Several elegant inductive proofs of Dilworth's theorem can be found in the literature. In this note, I present another inductive proof with an algorithmic flavor based on a merging lemma.
翻译:暂无翻译