Computer Science > Discrete Mathematics
arXiv:2606.06513 (cs)
[Submitted on 31 May 2026 (v1), last revised 14 Jun 2026 (this version, v2)]
Abstract: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.
Submission history
From: Tao Zhang [view email]
[v1]
Sun, 31 May 2026 15:14:11 UTC (36 KB)
[v2]
Sun, 14 Jun 2026 09:58:26 UTC (36 KB)
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Code, Data, Media
Code, Data and Media Associated with this Article
Demos
Demos
Related Papers
Recommenders and Search Tools
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

























