BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Richard Montgomery (Warwick)
DTSTART:20220525T130000Z
DTEND:20220525T140000Z
DTSTAMP:20260423T003246Z
UID:WCS/55
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/55/">On 
 the Ryser-Brualdi-Stein conjecture</a>\nby Richard Montgomery (Warwick) as
  part of Warwick Combinatorics Seminar\n\n\nAbstract\nThe Ryser-Brualdi-St
 ein conjecture states that every Latin square of order $n$ should have a p
 artial transversal with $n-1$ elements\, and a full transversal if $n$ is 
 odd. In 2020\, Keevash\, Pokrovskiy\, Sudakov and Yepremyan improved the l
 ong-standing best known bounds on this conjecture by showing that a partia
 l transversal with $n-O(\\log n/\\log\\log n)$ elements always exists. I w
 ill discuss how to show\, for large $n$\, that a partial transversal with 
 $n-1$ elements always exists.\n
LOCATION:https://researchseminars.org/talk/WCS/55/
END:VEVENT
END:VCALENDAR