Solution

ID: past-exam-of-the-probability-statistics-and-options-i-course-of-the-university-of-oxford/2007/r/1/viii/solution

True. Choose a root of the tree and color every vertex according to the parity of its graph distance from that root. The unique-path property implies that the endpoints of each edge have distances differing by one. Thus every edge crosses the two color classes, proving bipartite graph.

New to topics? Read the docs here!