English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A digraph $D$ is $k$-linked if it satisfies that for every choice of disjointsets $\{x_1,\ldots{},x_k\}$ and $\{y_1,\ldots{},y_k\}$ of vertices of $D$ thereare vertex disjoint paths $P_1,\ldots{},P_k$ such that $P_i$ is an$(x_i,y_i)$-path. Confirming a conjecture by K\"uhn et al, Pokrovskiy proved in2015 that every $452k$-strong tournament is $k$-linked and asked for a betterlinear bound. Very recently Meng et al proved that every $(40k-31)$-strongtournament is $k$-linked. In this note we use an important lemma from theirpaper to give a short proof that every $(13k-6)$-strong tournament of minimumout-degree at least $28k-13$ is $k$-linked.

Every $(13k-6)$-strong tournament with minimum out-degree at least $28k-13$ is $k$-linked