Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

How can we prove the following?

In a graph, if there is a k-length walk between two nodes, then there exists a path between those nodes of length p ≤ k.

share|cite|improve this question
up vote 2 down vote accepted

Simply take the vertices along the walk; if you come to the same vertex twice, erase everything that was in between.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.