Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked
type: Item
instance of: scholarly article
title: Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked
zbMATH Open document ID: 1486.05113
author: Kasper Skov Johansen
author: Jørgen Bang-Jensen
published in: Discrete Mathematics
publication date: 2022-04-11T00:00:00Z
full work available at URL: https://arxiv.org/abs/2108.02639
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7506211
zbMATH Keywords: tournament
zbMATH Keywords: linkage
zbMATH Keywords: connectivity
MaRDI profile type: MaRDI publication profile
Wikidata QID: Q114190546
OpenAlex ID: W4210639302
arXiv ID: 2108.02639
cites work: Q3815328
cites work: Digraphs
cites work: Classes of Directed Graphs
cites work: Tournaments and Semicomplete Digraphs
cites work: \((2k+1)\)-connected tournaments with large minimum out-degree are \(k\)-linked
cites work: Highly linked tournaments with large minimum out-degree
cites work: Spanning local tournaments in locally semicomplete digraphs
cites work: Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
cites work: An improved linear connectivity bound for tournaments to be highly linked
cites work: Highly linked tournaments
cites work: An improved linear edge bound for graph linkages
cites work: Q3337490
cites work: Highly connected non-2-linked digraphs
DOI: 10.1016/J.DISC.2022.112831
description: scientific article