Assertion: graph's number | /r/CapableOf | equal maximum size of a chain
Facets:
Source sentences:
text: Mirsky's theorem states that the minimum number of antichains into a partition into antichains equals the maximum size of a chain, and corresponds in the same way to the perfection of comparability graphs.