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.
Simply take the vertices along the walk; if you come to the same vertex twice, erase everything that was in between.
Sign up using Google
Sign up using Facebook
Sign up using Stack Exchange
3 years ago
Get the weekly newsletter!
see an example newsletter