Assertion: graph | /r/HasProperty | retract
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 2 n − m − k ≤ 2 holds, where m is the number of edges and k 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.