BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The number of symbols that forces a transversal - Liana Yepremyan 
 (University of Oxford)
DTSTART:20181129T143000Z
DTEND:20181129T153000Z
UID:TALK109981@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION: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}$  w
 ith 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.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR