paper

Immersion of complete digraphs in Eulerian digraphs

arXiv:2108.13959

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.

arXiv comment17 pages; fixed typos