University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Highly linked tournaments

## Highly linked tournamentsAdd to your list(s) Download to your calendar using vCal - António Girão (University of Birmingham)
- Thursday 17 January 2019, 13:00-14:00
- Watson LTB.
If you have a question about this talk, please contact Richard Montgomery. In this talk I shall talk about some properties of tournaments. A tournament is k-linked if for every two disjoint subsets A, B of order k and any assignment of the vertices of A to vertices of B there exist k vertex disjoint paths routing the prescribed pairs. We will discuss a recent result which asserts that there exists a function f such that for any positive integer k, if a tournament is 4k-strongly-connected and has minimum out-degree at least f(k), then it is k-linked. This comes close to resolving a conjecture of Pokrovskiy. Along the way, we show that a tournament with sufficiently large minimum out- degree contains a subdivision of a complete directed graph. This talk is part of the Combinatorics and Probability seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsAstrophysics Talks Series Pure Détours Artificial Intelligence and Natural Computation seminars## Other talksSignatures of structural criticality and universality in the cellular anatomy of the brain Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems [Friday seminar]: Irradiated brown dwarfs in the desert The percolating cluster is invisible to image recognition with deep learning |