Addressing a question posed by Chen and Ma from an asymptotic point of view, we present a short proof for the edge density needed to guarantee that two vertices of the same degree are connected by a path of a fixed length. In particular, we show that for any sufficiently large graph, a density of at least $1/2+o(1)$ enforces the existence of two such vertices. This bound is tight for paths of odd length.