Immersion of transitive tournaments in digraphs with large minimum outdegree

DOI10.1016/j.jctb.2018.05.004zbMath1402.05090arXiv1710.11482OpenAlexW2963102035WikidataQ129789044 ScholiaQ129789044MaRDI QIDQ1633763

William Lochet

Publication date: 20 December 2018

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

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

zbMATH Keywords

immersionsdigraphstransitive tournaments

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Immersion of transitive tournaments in digraphs with large minimum outdegree