Assertion: graph's number | /r/CapableOf | equal maximum size of an antichain
Facets:
Source sentences:
text: For instance, Dilworth's theorem states that the minimum number of chains in a partition of a partially ordered set into chains equals the maximum size of an antichain, and can be rephrased as stating that the complements of comparability graphs are perfect.