Immersion of complete digraphs in Eulerian digraphs
Combinatorics
2022-04-12 v2
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.
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