Hamilton cycles in highly connected and expanding graphs

Dan Hefetz, Michael Krivelevich, Tibor Szabo

In this paper we prove a sufficient condition for the existence of a Hamilton cycle, which is applicable to a wide variety of graphs, including relatively sparse graphs. In contras…