An improved linear connectivity bound for tournaments to be highly linked

DOI10.1016/J.EJC.2021.103390MaRDI QIDQ1979428zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

digraphlinkage structureslinkedness

Mathematics Subject Classification ID

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

Recommendations

• Highly linked tournaments
• Every (13k - 6)-strong tournament with minimum out-degree at least 28k - 13 is k-linked
• (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

Cites work

• An improved linear edge bound for graph linkages
• Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's conjecture
• Eine Verallgemeinerung des n-fachen Zusammenhangs für Graphen
• Graphs and matching theorems
• Highly connected non-2-linked digraphs
• Highly linked graphs
• Highly linked tournaments
• scientific article; zbMATH DE number 3869359 (Why is no real title available?)
• scientific article; zbMATH DE number 4085689 (Why is no real title available?)
• On Sufficient Degree Conditions for a Graph to be k-linked
• On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
• Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
• Subdivisions of digraphs in tournaments
• The extremal function for 3-linked graphs

Cited in

(12)

• Highly connected non-2-linked digraphs
• An extremal connectivity parameter of tournaments
• (2k+1)-connected tournaments with large minimum out-degree are k-linked
• Every (13k - 6)-strong tournament with minimum out-degree at least 28k - 13 is k-linked
• Highly linked tournaments with large minimum out-degree
• Improved results on linkage problems
• The average connectivity of regular multipartite tournaments
• Highly linked tournaments
• Counterexamples to the linkage conjecture for tournaments
• On the k-linkage problem for generalizations of semicomplete digraphs
• A new connectivity bound for a tournament to be highly linked
• Degree conditions for disjoint path covers in digraphs

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)