Grinberg-Introduction-Graph-Theory · Problem 2.9

Simple graphs

Mathematics — Graph Theory · path-edges-distinct

Problem

Let

G

be a simple graph. Let

\mathbf{w}

be a path in

G

. Prove that the edges of

\mathbf{w}

are distinct. (This may look obvious when you can point to a picture; but we ask you to give a rigorous proof!)