True. Every cycle in a bipartite graph has even length because its vertices alternate between the two parts. On a Hamiltonian cycle, choose every other edge. These edges are disjoint and cover every vertex exactly once, so they form a perfect matching.

Ancestors (14)

  1. ii
  2. c
  3. 1
  4. A
  5. 2009
  6. Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford
  7. Graph Theory and Probabilistic Combinatorics course of the University of Oxford
  8. Year 4 of the mathematics course of the University of Oxford
  9. Mathematics course of the University of Oxford
  10. Undergraduate course of the University of Oxford
  11. Course of the University of Oxford
  12. University of Oxford
  13. List of universities
  14. 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