BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability Seminar
SUMMARY:Exceptional times of the critical Erdős-Rényi grap
h - Matt Roberts (University of Bath)
DTSTART:20171017T140000Z
DTEND:20171017T150000Z
UID:TALK2827AT
URL:/talk/index/2827
DESCRIPTION:It is well known that the largest components in th
e critical Erdős-Rényi graph have size of order \n
n^{2/3}. We introduce a dynamic Erdős-Rény
i graph by rerandomising each edge at rate 1\, and
ask whether there exist times in [0\,1] at which
the largest component is significantly larger than
n^{2/3}.
LOCATION:Watson LTA
CONTACT:Guillem Perarnau
END:VEVENT
END:VCALENDAR