Pokrovskiy's strong tournament linking conjecture
Statement
A tournament is -strong if deleting fewer than vertices leaves a strongly connected tournament, and its minimum in-degree and minimum out-degree are the least in-degree and out-degree among its vertices. A tournament is -linked if, for every choice of distinct vertices , there are pairwise vertex-disjoint directed paths from to for . Pokrovskiy's conjecture. For every natural number there exists an integer such that every -strong tournament with minimum in-degree and minimum out-degree at least is -linked.
This conjecture proposes that sufficiently large minimum in-degree and out-degree, together with -strong connectivity, force -linkedness in tournaments. The source presents it as a conjecture of Pokrovskiy; no resolution is given in the supplied text.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.