Immersion of transitive tournaments in digraphs with large minimum outdegree
Abstract
We prove the existence of a function $h(k)$ such that every simple digraph with minimum outdegree greater than $h(k)$ contains an immersion of the transitive tournament on k vertices. This solves a conjecture of Devos, McDonald, Mohar and Scheide.
Domains
Combinatorics [math.CO]| Origin | Files produced by the author(s) |
|---|
Loading...