# Walks and paths in a graph

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.

-