k-Ordered Hamilton cycles in digraphs

Simple item page
dc.creatorKühn, Daniela
dc.creatorOsthus, Deryk
dc.creatorYoung, Andrew
dc.date2007-07-11
dc.date.accessioned2026-07-07T08:15:04Z
dc.date.available2026-07-07T08:15:04Z
dc.descriptionGiven a digraph D, the minimum semi-degree of D is the minimum of its minimum indegree and its minimum outdegree. D is k-ordered Hamiltonian if for every ordered sequence of k distinct vertices there is a directed Hamilton cycle which encounters these vertices in this order. Our main result is that every digraph D of sufficiently large order n with minimum semi-degree at least (n+k)/2 -1 is k-ordered Hamiltonian. The bound on the minimum semi-degree is best possible. An undirected version of this result was proved earlier by Kierstead, Sárközy and Selkow.
dc.identifierhttps://arxiv.org/abs/0707.1577
dc.identifierhttp://arxiv.org/abs/0707.1577
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133345
dc.subjectCombinatorics
dc.subject05C20; 05C38; 05C45; 05C35
dc.titlek-Ordered Hamilton cycles in digraphs
dc.typetext

Files

Collections

arXiv