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

Highly linked tournaments

Add to your list(s) Download to your calendar using vCal

  • UserAntónio Girão (University of Birmingham)
  • ClockThursday 17 January 2019, 13:00-14:00
  • HouseWatson 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.