Abstract
A digraph \emph{immerses} a digraph if there is an injection and a collection of pairwise edge-disjoint directed paths , for , such that starts at and ends at . We prove that every Eulerian digraph with minimum out-degree immerses a complete digraph on vertices, thus answering a question of DeVos, Mcdonald, Mohar, and Scheide.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.