An improved linear connectivity bound for tournaments to be highly linked
From MaRDI portal
Publication:1979428
DOI10.1016/j.ejc.2021.103390zbMath1471.05040OpenAlexW3185918591MaRDI QIDQ1979428
Gexin Yu, Martin Rolek, Wei Meng, Yue Wang
Publication date: 2 September 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2021.103390
Related Items
Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked, Improved results on linkage problems
Cites Work
- Unnamed Item
- Unnamed Item
- Highly linked tournaments
- Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture
- Graphs and matching theorems
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
- The extremal function for 3-linked graphs
- Highly connected non-2-linked digraphs
- Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
- An improved linear edge bound for graph linkages
- Subdivisions of digraphs in tournaments
- 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 Sufficient Degree Conditions for a Graph to be $k$-linked
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
