University of Cambridge > Talks.cam > Combinatorics Seminar > The number of symbols that forces a transversal

The number of symbols that forces a transversal

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

  • UserLiana Yepremyan (University of Oxford)
  • ClockThursday 29 November 2018, 14:30-15:30
  • HouseMR12.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity