Immersion of complete digraphs in Eulerian digraphs
Abstract
A digraph G immerses a digraph H if there is an injection f : V(H) V(G) and a collection of pairwise edge-disjoint directed paths Puv, for uv ∈ E(H), such that Puv starts at u and ends at v. We prove that every Eulerian digraph with minimum out-degree t immerses a complete digraph on (t) vertices, thus answering a question of DeVos, Mcdonald, Mohar, and Scheide.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.