Dilworth 1950 (Ann. Math. 51:161) — the minimum number of totally-ordered chains needed to partition a finite poset P equals the maximum size of an antichain. This is the min-max duality at the heart of order theory, a direct…
Dilworth 1950 (Ann. Math. 51:161) — the minimum number of totally-ordered chains needed to partition a finite poset P equals the maximum size of an antichain. This is the min-max duality at the heart of order theory, a direct…