Name
Abstract | ||
|---|---|---|
We prove that there exists a function f:N→N such that for any positive integer k, if T is a strongly 4k-connected tournament with minimum out-degree at least f(k), then T is k-linked. This resolves a conjecture of Pokrovskiy up to a factor of 2 of the required connectivity. Along the way, we show that a tournament with sufficiently large minimum out-degree contains a subdivision of a complete directed graph. This result may be of independent interest. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.jctb.2019.02.009 | Journal of Combinatorial Theory, Series B |
Keywords | DocType | Volume |
Tournaments,Connectivity of tournaments,Linkedness,Subdivisions in tournaments | Journal | 139 |
ISSN | Citations | PageRank |
0095-8956 | 1 | 0.36 |
References | Authors | |
1 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| António Girão | 1 | 1 | 3.07 |
| Richard Snyder | 2 | 1 | 1.04 |