Dual to Dilworth: in any finite poset, the minimum number of antichains needed to partition P equals the maximum length of a chain (the height h(P)). Proved by Leon Mirsky 1971. The two theorems together are equivalent to the bipartite…
Dual to Dilworth: in any finite poset, the minimum number of antichains needed to partition P equals the maximum length of a chain (the height h(P)). Proved by Leon Mirsky 1971. The two theorems together are equivalent to the bipartite…