 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2015/functional-programming-design-and-analysis-of-algorithms/6/d/solution

No. A tree consisting of a single edge

uv

{u}

and

{v}

. Each has size one, and neither can be enlarged because

u, v

are adjacent. Thus even a two-vertex tree gives a counterexample to uniqueness.

 New to topics? Read the docs here!