The number of symbols that forces a transversal
Add to your list(s)
Download to your calendar using vCal
Liana Yepremyan (University of Oxford)
Thursday 29 November 2018, 14:30-15:30
MR12.
If you have a question about this talk, please contact Andrew Thomason.
Akbari and Alipour conjectured that any Latin array of order $n$ with at least $n2/2$ symbols contains a transversal, or equivalently, every proper-edge coloring of the complete bipartite graph $K_{n,n}$ with n2/2 colours contains a rainbow perfect matching. In this talk we will present a proof of this conjecture in a stronger sense: we show that $n^{399/200}$ colours suffice. This is joint work with Peter Keevash.
This talk is part of the Combinatorics Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|