Immersion of transitive tournaments in digraphs with large minimum outdegree

DOI10.1016/J.JCTB.2018.05.004zbMATH Open1402.05090arXiv1710.11482OpenAlexW2963102035WikidataQ129789044 ScholiaQ129789044MaRDI QIDQ1633763FDOQ1633763

William Lochet

Publication date: 20 December 2018

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1710.11482

zbMATH Keywords

digraphsimmersionstransitive tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Cites Work

• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
• Topological cliques in graphs II
• A minimum degree condition forcing complete graph immersion
• Even cycles in directed graphs
• Degree and local connectivity in digraphs
• Immersing complete digraphs

Cited In (2)

• Immersion of complete digraphs in Eulerian digraphs
• Subdivisions in dicritical digraphs with large order or digirth

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)