Immersion of transitive tournaments in digraphs with large minimum outdegree
Combinatorics
2017-11-01 v1
Abstract
We prove the existence of a function such that every simple digraph with minimum outdegree greater than contains an immersion of the transitive tournament on vertices. This solves a conjecture of Devos, McDonald, Mohar and Scheide.
Cite
@article{arxiv.1710.11482,
title = {Immersion of transitive tournaments in digraphs with large minimum outdegree},
author = {W. Lochet},
journal= {arXiv preprint arXiv:1710.11482},
year = {2017}
}