Assertion: directed graph | /r/CapableOf | have at most n 2
Facets:
Source sentences:
text: {\displaystyle \left({\begin{array}{c}n+1\\2\end{array}}\right)} edges (one for each unordered pair), while a directed graph can have at most n 2 {\displaystyle n^{2}} edges (one per ordered pair).