
AbstractA 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 f(u) and ends at f(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.
FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)
FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
