BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Stefan Glock (ETH Zurich)
DTSTART:20210412T140000Z
DTEND:20210412T150000Z
DTSTAMP:20260423T052549Z
UID:EPC/50
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/50/">Lon
 g induced paths in sparse random graphs (rescheduled from Feb 22)</a>\nby 
 Stefan Glock (ETH Zurich) as part of Extremal and probabilistic combinator
 ics webinar\n\n\nAbstract\nThe study of induced trees in random graphs was
  initiated by Erdős and Palka in the 80s. Many interesting questions rema
 in unanswered\, especially in the sparse case when the average degree is c
 onstant. For instance: what is the length of a longest induced path?\n\nNa
 tural algorithms produce an induced path of length roughly half the conjec
 tured optimal value\, which has not been improved in the last 30 years.\n\
 nWe show that one can do better than that\, which answers a question of Fe
 rnandez de la Vega. Unfortunately\, we only get halfway towards the upper 
 bound. We will explain the main ideas and explore possible ways to close t
 he remaining gap.\n
LOCATION:https://researchseminars.org/talk/EPC/50/
END:VEVENT
END:VCALENDAR