Immersion of transitive tournaments in digraphs with large minimum outdegree
classification
🧮 math.CO
keywords
immersionminimumoutdegreetransitiveconjecturecontainsdevosdigraph
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.