An effective version of Dilworth’s theorem
Open Access
- 1 January 1981
- journal article
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 268 (1) , 63
- https://doi.org/10.1090/s0002-9947-1981-0628446-x
Abstract
We prove that if is a recursive partial order with finite width , then can be covered by recursive chains. For each we show that there is a recursive partial ordering of width that cannot be covered by recursive chains.Keywords
This publication has 5 references indexed in Scilit:
- Recursive Colorings of GraphsCanadian Journal of Mathematics, 1980
- Recursive Euler and Hamilton PathsProceedings of the American Mathematical Society, 1976
- Recursion theory and algebraPublished by Springer Nature ,1975
- A proof of dilworth’s decomposition theorem for partially ordered setsIsrael Journal of Mathematics, 1963
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950