Highly linked tournaments

DOI10.1016/j.jctb.2015.05.005zbMath1319.05063arXiv1406.7552OpenAlexW433207136MaRDI QIDQ491002

Alexey Pokrovskiy

Publication date: 21 August 2015

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

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

zbMATH Keywords

connectivity of tournamentslinkage structureslinkedness

Mathematics Subject Classification ID

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

Related Items (13)

Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked ⋮ Strong complete minors in digraphs ⋮ Bipartitions of highly connected tournaments ⋮ Sparse Spanning $k$-Connected Subgraphs in Tournaments ⋮ Improved results on linkage problems ⋮ Subdivisions of digraphs in tournaments ⋮ An improved linear connectivity bound for tournaments to be highly linked ⋮ Characterization of \(k\)-subconnected graphs ⋮ On 1-factors with prescribed lengths in tournaments ⋮ Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs ⋮ \((2k+1)\)-connected tournaments with large minimum out-degree are \(k\)-linked ⋮ Tournaments and Semicomplete Digraphs ⋮ Highly linked tournaments with large minimum out-degree

Cites Work

• Unnamed Item
• Unnamed Item
• Bipartitions of highly connected tournaments
• Sorting in \(c \log n\) parallel steps
• 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

This page was built for publication: Highly linked tournaments