Assertion: string graph | /r/HasProperty | partitioned into two subsets
Facets:
Source sentences:
text: Every m-edge string graph can be partitioned into two subsets, each a constant fraction the size of the whole graph, by the removal of O(m3/4log1/2m) edges.