Let $K_n$ be the complete graph with $n$ vertices, where the vertices are labelled $1,2,3,\dots,n$. How many paths are there between $v_1$ and $v_n$ that the labels on the path are strictly increasing?
I know that I need to first choose the possible vertices in the path, then consider the possible order of those vertices.