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.

Ancestors (12)

  1. 1
  2. R
  3. 2007
  4. Past exam of the probability, statistics and options I course of the University of Oxford
  5. Probability, statistics and options I course of the University of Oxford
  6. Year 2 of the mathematics and statistics course of the University of Oxford
  7. Mathematics and statistics course of the University of Oxford
  8. Undergraduate course of the University of Oxford
  9. Course of the University of Oxford
  10. University of Oxford
  11. List of universities
  12. Home

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version