Assertion: graph's number | /r/HasProperty | the dimension of the hypercube
Facets:
Source sentences:
text: However, the number of edges cannot be too small: Klavžar, Mulder & Škrekovski (1998) prove that in every median graph the inequality holds, where is the number of edges and is the dimension of the hypercube that the graph is a retract of.
text: However, the number of edges cannot be too small: Klavžar, Mulder & Škrekovski (1998) prove that in every median graph the inequality holds, where is the number of edges and is the dimension of the hypercube that the graph is a retract of.