Hamilton cycles in highly connected and expanding graphs
Combinatorics
2007-05-23 v1
Abstract
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 contrast to previous criteria, ours is based on only two properties: one requiring expansion of ``small'' sets, the other ensuring the existence of an edge between any two disjoint ``large'' sets. We also discuss applications in positional games, random graphs and extremal graph theory.
Keywords
Cite
@article{arxiv.math/0612751,
title = {Hamilton cycles in highly connected and expanding graphs},
author = {Dan Hefetz and Michael Krivelevich and Tibor Szabo},
journal= {arXiv preprint arXiv:math/0612751},
year = {2007}
}
Comments
19 pages