On the structure of the set of cycle lengths in a Hamiltonian graph (Q1883261)

The author studies the set of cycle lengths in a Hamiltonian graph \(G\) of order \(n\) with two fixed nonadjacent vertices \(x,y\) whose degree sum satisfies \(d(x) + d(y) \geq n+z,\) where \(z \geq 1.\) He proves that this set of cycle lengths contains all integers between \(3\) and \(\frac{4n+4z+32}{19}.\) This improves and generalizes results of \textit{R. Faudree} et al. [Discuss. Math., Graph Theory 16, 27--40 (1996; Zbl 0879.05042)] and \textit{U. Schelten} and \textit{I. Schiermeyer} [Discrete Appl. Math. 79, 201--211 (1997; Zbl 0882.05082)]. He also shows that if \(z \geq \frac{5n}{18},\) then \(G\) contains a cycle of length \(p\) for every \(p\) satisfying \(3 \leq p \leq \frac{n+z}{2} + 1.\)