k-Ordered Hamilton cycles in digraphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Given 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\'ark\"ozy and Selkow.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

k-Ordered Hamilton cycles in digraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with k-Ordered Hamilton cycles in digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and k-Ordered Hamilton cycles in digraphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-434752

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.