BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:e866042a-2d26-4ffb-ae7f-5c420bac9be1
X-WR-CALNAME:[gt.go] - 'Induced subgraphs and logarithmic tree width' by Ma
 ria Chudnovsky
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20231029T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20211031T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
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:e866042a-2d26-4ffb-ae7f-5c420bac9be1
DTSTAMP:20260404T120252Z
CLASS:PUBLIC
DESCRIPTION:/Exposé en anglais/Talk in english/ \n\nTree decompositions are
  a powerful tool in structural graph theory\; they are traditionally used 
 in the context of forbidden graph minors. Connecting tree decompositions a
 nd forbidden induced subgraphs has until recently remained out of reach. T
 ree decompositions are closely related to the existence of 'laminar collec
 tions of separations' in a graph\, which roughly means that the separation
 s in the collection 'cooperate' with each other\, and the pieces that are 
 obtained when the graph is simultaneously decomposed by all the separation
 s in the collection 'line up' to form a tree structure. Such collections o
 f separations come up naturally in the context of forbidden minors. In the
  case of families where induced subgraphs are excluded\, while there are o
 ften natural separations\, they are usually very far from forming a lamina
 r collection. However\, under certain circumstances\, these collections of
  natural separations can be partitioned into a number of laminar collectio
 ns\, and the number of laminar collections needed is logarithmic in the nu
 mber of vertices of the graph. This in turn allows us to obtain a wide var
 iety of structural and algorithmic results\, which we will discuss in this
  talk. \n\n[Maria Chudnovsky] (Princeton University) \n\nhttp://web.math.p
 rinceton.edu/~mchudnov/ \n\n\n{Remarques/Remarks} \n\n▼ \nCet exposé sera 
 enregistré\, merci de désactiver votre webcam et micro si vous ne souhaite
 z pas apparaître sur l'enregistrement. Les échanges informels avant et apr
 ès l'exposé\, ainsi que les questions\, ne seront pas 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 des discussions inform
 elles post-GT. \n\nÀ très bientôt\, \n\nClaire\, Marthe & Jonathan \n\nRet
 rouvez toutes les informations du GT dématérialisé sur https://combalgo.la
 bri.fr/pmwiki.php/Groupe/GT-en-LIGNE \n\n\n▼ \nThis presentation will be r
 ecorded\, please deactivate your webcam and microphone if you do not wish 
 to appear on the recording. Informal exchanges before and after the presen
 tation\, as well as questions\, will not be recorded. \n\nDo not hesitate 
 to come a little before the start of the presentation to test (and chat in
 formally). We will also have informal post-working group discussions. \n\n
 See you soon\, \n\nClaire\, Marthe & Jonathan \n\nFind all the information
  of the dematerialized working group on the web page https://combalgo.labr
 i.fr/pmwiki.php/Groupe/GT-en-LIGNE
DTSTART;TZID=Europe/Paris:20211105T140000
DTEND;TZID=Europe/Paris:20211105T150000
LOCATION:A30/178 et sur https://u-bordeaux-fr.zoom.us/j/4939941120
SEQUENCE:0
SUMMARY:[gt.go] - 'Induced subgraphs and logarithmic tree width' by Maria C
 hudnovsky
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
