English

Immersion of complete digraphs in Eulerian digraphs

Combinatorics 2022-04-12 v2

Abstract

A digraph GG \emph{immerses} a digraph HH if there is an injection f:V(H)V(G)f : V(H) \to V(G) and a collection of pairwise edge-disjoint directed paths PuvP_{uv}, for uvE(H)uv \in E(H), such that PuvP_{uv} starts at uu and ends at vv. We prove that every Eulerian digraph with minimum out-degree tt immerses a complete digraph on Ω(t)\Omega(t) vertices, thus answering a question of DeVos, Mcdonald, Mohar, and Scheide.

Cite

@article{arxiv.2108.13959,
  title  = {Immersion of complete digraphs in Eulerian digraphs},
  author = {António Girão and Shoham Letzter},
  journal= {arXiv preprint arXiv:2108.13959},
  year   = {2022}
}

Comments

17 pages; fixed typos

R2 v1 2026-06-24T05:34:16.259Z