Assertion: graph's value | /r/HasProperty | the maximum of the values
Facets:
value: for all two graphs
type: OTHER
Source sentences:
text: A graph invariant is maxing if, for all two graphs G and H, the value of the invariant on the disjoint union of G and H is the maximum of the values on G and on H.