Assertion: undirected graph | /r/CapableOf | represent some hypergraph
Facets:
value: in the manner
type: MANNER
Source sentences:
text: the sets X and E are the partitions of BG, and (x 1 , e 1 ) are connected with an edge if and only if vertex x 1 is contained in edge e 1 in H. Conversely, any bipartite graph with fixed parts and no unconnected nodes in the second part represents some hypergraph in the manner described above.