BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Lutz Warnke (Georgia Institute of Technology)
DTSTART:20200518T130000Z
DTEND:20200518T140000Z
DTSTAMP:20260423T021035Z
UID:EPC/5
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/5/">Coun
 ting extensions in random graphs</a>\nby Lutz Warnke (Georgia Institute of
  Technology) as part of Extremal and probabilistic combinatorics webinar\n
 \n\nAbstract\nWe consider rooted subgraphs in random graphs\, i.e.\, exten
 sion counts such as (a) the number of triangles containing a given `root' 
 vertex\, or (b) the number of paths of length three connecting two given `
 root' vertices. \n\nIn 1989 Spencer gave sufficient conditions for the eve
 nt that\, whip\, all roots of the binomial random graph G(n\,p) have the s
 ame asymptotic number of extensions\, i.e.\, (1 \\pm \\epsilon) times thei
 r expected number. \n\nFor the important strictly balanced case\, Spencer 
 also raised the fundamental question whether these conditions are necessar
 y. \n\nWe answer this question by a careful second moment argument\, and d
 iscuss some intriguing problems that remain open.\n\nJoint work with Matas
  Sileikis\, see arXiv:1911.03012\n\nPassword: the first 6 prime numbers (8
  digits in total)\n
LOCATION:https://researchseminars.org/talk/EPC/5/
END:VEVENT
END:VCALENDAR