Assertion: graph's edge | /r/CapableOf | cross the two halves
Facets:
Source sentences:
text: If we apply this to a graph constructed with two halves that have a random 0.5 probability of an edge in each half, and only a 0.1 probability of an edge crossing the two halves, this program can find the two halves.