Immersing complete digraphs

Details Immersing complete digraphs Immersing complete digraphs

2011-09-17

arxiv.org/abs/1109.3741v1

Mathematics

Combinatorics

Scientific paper

We consider the problem of immersing the complete digraph on t vertices in a simple digraph. For Eulerian digraphs, we show that such an immersion always exists whenever minimum degree is at least t(t-1), and for t at most 4 minimum degree at least t-1 suffices. On the other hand, we show that there exist non-Eulerian digraphs with all vertices of arbitrarily high in- and outdegree which do not contain an immersion of the complete digraph on 3 vertices. As a side result, we obtain a construction of digraphs with large outdegree in which all cycles have odd length, simplifying a former construction of such graphs by Thomassen.

Affiliated with

Also associated with

No associations

Rating

Immersing complete 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 Immersing complete digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Immersing complete digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-142205