BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: A digraph F is n-unadoidable} (resp. n-universal) if it is con
 tained in every tournament of order n (resp. n-chromatic digraph). Well-kno
 wn theorems imply that there is an n F  such that F is n F -unavoidable (re
 sp. n F -universal) if and only if F is acyclic\, (resp. an oriented forest
 ). However\, determining the smallest n F  for which it occurs is a challen
 ging question. In this talk\, we survey the results on unavoidability and u
 niversality and detail some recent recults obtained with various co-authors
 . 
DTSTAMP:20210630T170000
DTSTART:20210712T141500
CLASS:PUBLIC
LOCATION:online
SEQUENCE:0
SUMMARY:Frédéric Havet (INRIA Sophia-Antipolis): Unavoidability and univers
 ality of digraphs
UID:107919175@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20210712-L-Hav
 et.html
END:VEVENT
END:VCALENDAR