BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:2cc76600-fef3-4162-9d38-ea586bf0ac22
X-WR-CALNAME:[gt.go] - 'Counting H-free orientations of graphs' by Oliver J
 anzer
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20231029T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20201025T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20211031T030000
RDATE:20221030T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20210328T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20220327T020000
RDATE:20230326T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:2cc76600-fef3-4162-9d38-ea586bf0ac22
DTSTAMP:20260404T131749Z
CLASS:PUBLIC
DESCRIPTION:/ExposÃ© en anglais/Talk in english/\n\nIn 1974\, ErdÅ‘s posed th
 e following problem. Given an oriented graph H\, determine or estimate the
  maximum possible number of H-free orientations of an n-vertex graph. When
  H is a tournament\, the answer was determined precisely for sufficiently 
 large n by Alon and Yuster. In general\, when the underlying undirected gr
 aph of H contains a cycle\, one can obtain accurate bounds by combining an
  observation of Kozma and Moran with celebrated results on the number of F
 -free graphs. We resolve all remaining cases in an asymptotic sense\, ther
 eby giving a rather complete answer to ErdÅ‘s's question. Moreover\, we det
 ermine the answer exactly when H is an odd cycle and n is sufficiently lar
 ge\, answering a question of AraÃºjo\, Botler and Mota. \n\nJoint work with
  Matija Bucic and Benny Sudakov. \n\n\n[Oliver Janzer] (ETH ZÃ¼rich)\n\nhtt
 ps://sites.google.com/view/oliver-janzer/home \n\n\n{Remarques/Remarks}\n
 \nânâ\nCet exposÃ© sera enregistrÃ©\, merci de dÃ©sactiver votre webcam et micr
 o si vous ne souhaitez pas apparaÃ®tre sur l'enregistrement. Les Ã©changes i
 nformels avant et aprÃ¨s l'exposÃ©\, ainsi  que les questions\, ne seront pa
 s enregistrÃ©s.\n\nN'hÃ©sitez pas Ã  venir un peu avant le dÃ©but de l'exposÃ© 
 pour faire des tests (et discuter informellement). Nous auront Ã©galement d
 es discussions informelles post-GT.\n\nÃ€ trÃ¨s bientÃ´t\, \n\nMarthe & Jonat
 han\n\nRetrouvez toutes les informations du GT dÃ©matÃ©rialisÃ© sur https://c
 ombalgo.labri.fr/pmwiki.php/Groupe/GT-en-LIGNE\n\n\nâ–¼\nThis presentation w
 ill be recorded\, please deactivate your webcam and microphone if you do n
 ot wish to appear on the recording. Informal exchanges before and after th
 e presentation\, as well as questions\, will not be recorded.\n\nDo not he
 sitate to come a little before the start of the presentation to test (and 
 chat informally). We will also have informal post-working group discussion
 s.\n\nSee you soon\,\n\nMarthe & Jonathan\n\nFind all the information of t
 he dematerialized working group on the web page https://combalgo.labri.fr/
 pmwiki.php/Groupe/GT-en-LIGNE
DTSTART;TZID=Europe/Paris:20210924T140000
DTEND;TZID=Europe/Paris:20210924T150000
LOCATION:A30/178 et sur https://webconf.u-bordeaux.fr/b/mar-ef4-zed
SEQUENCE:0
SUMMARY:[gt.go] - 'Counting H-free orientations of graphs' by Oliver Janzer
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
