Immersion of transitive tournaments in digraphs with large minimum outdegree

摘要

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. (C) 2018 Elsevier Inc. All rights reserved.