2000 character limit reached
Immersion of complete digraphs in Eulerian digraphs
Published 31 Aug 2021 in math.CO | (2108.13959v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.