BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:8c9e1c04-4090-4589-8aad-190494f04ed4
X-WR-CALNAME:[gt.go] - 'Long paths and graphs excluding patterns' par Julie
 n Duron
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20261025T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
RDATE:20251026T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20250330T020000
RDATE:20260329T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:8c9e1c04-4090-4589-8aad-190494f04ed4
DTSTAMP:20260416T190416Z
CLASS:PUBLIC
DESCRIPTION:Consider a graph G with a path P of order n. What conditions fo
 rce G to also have a long induced path? \n\nIn this talk\, we will propose
  a new way to approach this problem\, by viewing G as an ordered graph (wh
 ere the vertices are ordered according to their position on the path P). F
 rom this point of view\, it is most natural to consider which ordered subg
 raphs need to be forbidden in order to force the existence of a long induc
 ed path. Using this approach we improve or recover several existing result
 swith much simpler proofs\, in a unified way. We also show that if somefor
 bidden subgraph forces the existence of a long induced path in G\,then thi
 s induced path has size at least c(log log log n)^1/3$\, and ismonotone wi
 th respect to P. \n\nThis is based on joint work with Jean-Florent Raymond
  and Louis Esperet. \n\nJulien Duron [ENS Lyon] \nhttps://perso.ens-lyon.f
 r/julien.duron/ \n\nVérifiez que vous êtes bien inscrits sur le site du [g
 dr-ifm-gt-graphes] : [ https://gtgraphes.labri.fr/pmwiki/pmwiki.php/Equipe
 s/Equipes#membres | https://gtgraphes.labri.fr/pmwiki/pmwiki.php/Equipes/E
 quipes#membres ] \n\nRemarks / Remarques \n\nFind all the information of t
 he working group on this [ https://graphesetoptimisation.labri.fr/pmwiki.p
 hp/Groupe/GT?userlang=en | web page ] . \nRetrouvez toutes les information
 s du GT sur cette [ https://graphesetoptimisation.labri.fr/pmwiki.php/Grou
 pe/GT | page web ] .
DTSTART;TZID=Europe/Paris:20241011T140000
DTEND;TZID=Europe/Paris:20241011T150000
LOCATION:LaBRI/178
SEQUENCE:0
SUMMARY:[gt.go] - 'Long paths and graphs excluding patterns' par Julien Dur
 on
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
