Highly linked tournaments with large minimum out-degree

DOI10.1016/j.jctb.2019.02.009zbMath1428.05123arXiv1801.08249OpenAlexW2964056270WikidataQ128203202 ScholiaQ128203202MaRDI QIDQ2338640

Richard Snyder, António Girão

Publication date: 21 November 2019

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

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

zbMATH Keywords

tournamentsconnectivity of tournamentslinkednesssubdivisions in tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items

Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked, Subdivisions of digraphs in tournaments, On 1-factors with prescribed lengths in tournaments, \((2k+1)\)-connected tournaments with large minimum out-degree are \(k\)-linked

Cites Work

• Highly linked tournaments
• Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz
• Degree and local connectivity in digraphs
• Even cycles in directed graphs
• Highly connected non-2-linked digraphs
• An improved linear edge bound for graph linkages
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• Highly linked graphs
• Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
• Unnamed Item
• Unnamed Item