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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

The number of symbols that forces a transversal

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Fluid Mechanics (DAMTP) McGrath Centre, St Catharine’s College & online Seminar time is 1pm BST in Room FW 11, Willam Gates Hall. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon

Other talks

Teams Announced Cambridge RNA Club - IN PERSON External Seminar - Michael Raissig TBC Clonal haematopoiesis, early detection and pre-leukemia to leukemia development Bigger Picture Talk: Developing future marine engines running on ammonia and other green fuels CSAR lecture: 46&: Development of a probiotic that supports the natural removal of forever chemicals from the body
 

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