For a finite graph choose a simple path of maximum length. Every neighbor of its final vertex must already lie on the path, since otherwise that vertex could be appended. The final vertex has degree at least two, so besides its predecessor it has another neighbor earlier on the path. That edge together with the intervening path segment makes a cycle in a graph.
Finiteness is needed for this assertion in general: the two-sided infinite path has degree two at every vertex and no cycle in a graph. The customary finite-graph convention is used here and in the subsequent cube questions.

Ancestors (14)

  1. a
  2. i
  3. 2
  4. R
  5. 2008
  6. Past exam of the Probability, statistics and options II course of the University of Oxford
  7. Probability, statistics and options II course of the University of Oxford
  8. Year 2 of the mathematics and statistics course of the University of Oxford
  9. Mathematics and statistics 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