P
Initializing...
Proof of Proposition 3.4, p. 407 — a graph with k nodes and no cycles has at most k − 1 edges · Prove2Me