Immersion of transitive tournaments in digraphs with large minimum outdegree

From MaRDI portal
(Redirected from Publication:1633763)




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 page was built for publication: Immersion of transitive tournaments in digraphs with large minimum outdegree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633763)