University of Cambridge > Talks.cam > Combinatorics Seminar > Large transversals in Equi-n-squares

Large transversals in Equi-n-squares

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

  • UserRichard Montgomery (Warwick)
  • ClockThursday 05 December 2024, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact ibl10.

In 1975 Stein conjectured that any n by n square in which each cell has one of n symbols, so that each symbol is used exactly n times, contains a set of n-1 cells which share no row, column or symbol. That is, he conjectured that every equi-n-square must contain a transversal with n-1 cells. If true, this would be a widespread generalisation of the well-known Ryser-Brualdi-Stein conjecture on Latin squares, but, as shown by Pokrovskiy and Sudakov in 2019, Stein’s equi-n-square conjecture is false. I will discuss the extent to which this conjecture is false, giving new bounds in both directions for the underlying extremal problem, and in particular show that an approximate version of Stein’s conjecture is true.

This is joint work with Debsoumya Chakraborti and Teo Petrov.

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-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity