P

Initializing...

Lemma C.1, p. 44 (first sentence) — a connected acyclic matching network graph has at least n − d + 1 leaves · Prove2Me