2021/08/31 by Girão, António, Letzter, Shoham
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2108.13959
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.