Assertion: graph's edge | /r/HasProperty | divided by maximum number of edges
Facets:
Source sentences:
text: If we define the density of the graph as d = e/n2 (number of edges divided by the maximum number of edges), we can find the "breakpoint" where a list takes up more memory than a matrix: