BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Alistair Benford (Birmingham)
DTSTART:20220504T130000Z
DTEND:20220504T140000Z
DTSTAMP:20260423T020954Z
UID:WCS/53
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/53/">Tre
 es in tournaments</a>\nby Alistair Benford (Birmingham) as part of Warwick
  Combinatorics Seminar\n\n\nAbstract\nGiven an $n$-vertex oriented tree $T
 $\, what is the smallest size a tournament $G$ must be\, in order to guara
 ntee $G$ contains a copy of $T$? A strengthening of Sumner’s conjecture 
 poses that it is enough for $G$ to have $(n+k-1)$ vertices\, where $k$ is 
 the number of leaves of $T$. In this talk we will look at recent progress 
 towards this conjecture. We shall also consider how this problem can be ad
 dressed by instead considering the maximum degree of the tree\, rather tha
 n the number of leaves\, and state some open problems in this maximum degr
 ee setting. This is joint work with Richard Montgomery.\n
LOCATION:https://researchseminars.org/talk/WCS/53/
END:VEVENT
END:VCALENDAR