Locating any two vertices on Hamiltonian cycles

Abstract

In this paper we give a proof of Enomoto's conjecture for graphs of sufficiently large order. Enomoto's conjecture states that, if $G$ is a graph of order $n$ with minimum degree $\hat{I}´(G)\ge \frac{n}{2}+1$, then for any pair of vertices $x$, $y$ in $G$, there is a Hamiltonian cycle $C$ of $G$ such that $d_C(x,y)=\lfloor \frac{n}{2}\rfloor$. The main tools of our proof are Regularity Lemma of Szemerédi and Blow-up Lemma of Komlós et al.