An improved linear connectivity bound for tournaments to be highly linked
From MaRDI portal
Publication:1979428
DOI10.1016/J.EJC.2021.103390zbMATH Open1471.05040OpenAlexW3185918591MaRDI QIDQ1979428FDOQ1979428
Authors: Wei Meng, Martin Rolek, Yue Wang, Gexin Yu 
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
Recommendations
Cites Work
- An improved linear edge bound for graph linkages
- Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
- Highly linked graphs
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Title not available (Why is that?)
- Highly linked tournaments
- Graphs and matching theorems
- Title not available (Why is that?)
- On Sufficient Degree Conditions for a Graph to be $k$-linked
- Highly connected non-2-linked digraphs
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
- The extremal function for 3-linked graphs
- Subdivisions of digraphs in tournaments
Cited In (7)
- The average connectivity of regular multipartite tournaments
- Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked
- Highly linked tournaments
- \((2k+1)\)-connected tournaments with large minimum out-degree are \(k\)-linked
- Highly linked tournaments with large minimum out-degree
- Improved results on linkage problems
- An extremal connectivity parameter of tournaments
This page was built for publication: An improved linear connectivity bound for tournaments to be highly linked
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979428)
