Assertion: graph's number | /r/CapableOf | equal maximum size of a clique
Facets:
Source sentences:
text: A proof that a class of graphs is perfect can be seen as a min-max theorem: the minimum number of colors needed for these graphs equals the maximum size of a clique.