Finding A Path Of Length k: An Expository

Given a graph $G(V,E)$ and a positive integer $k$ ($k\ge 1$), a simple path on $k$ vertices is a sequence of $k$ vertices in which no vertex appears more than once and each consecutive pair of vertices in the sequence are connected by an edge. This paper provides an overview of current research on the existence and counting of k-paths in graphs.