Locating pairs of vertices on Hamiltonian cycles

Given a fixed positive integer k≥2k≥2 and a fixed pair of vertices xx and yy in a graph of sufficiently large order n=n(k)n=n(k), minimum degree conditions that imply the existence of a Hamiltonian cycle CC such that the distance on the cycle CC between xx and yy is precisely kk will be proved.