Hamilton cycles in highly connected and expanding graphs

Simple item page
dc.creatorHefetz, Dan
dc.creatorKrivelevich, Michael
dc.creatorSzabo, Tibor
dc.date2006-12-24
dc.date.accessioned2026-07-07T07:37:02Z
dc.date.available2026-07-07T07:37:02Z
dc.descriptionIn 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.
dc.description19 pages
dc.identifierhttps://arxiv.org/abs/math/0612751
dc.identifierhttp://arxiv.org/abs/math/0612751
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/120636
dc.subjectCombinatorics
dc.subject05C45, 05C38, 05C80
dc.titleHamilton cycles in highly connected and expanding graphs
dc.typetext

Files

Collections

arXiv