BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Benjamin Gunby (Harvard University)
DTSTART:20210107T020000Z
DTEND:20210107T030000Z
DTSTAMP:20260423T021014Z
UID:SCMSComb/27
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SCMSComb/27/
 ">Upper Tails in Random Regular Graphs</a>\nby Benjamin Gunby (Harvard Uni
 versity) as part of SCMS Combinatorics Seminar\n\n\nAbstract\nFix a graph 
 K. What is the probability that a sparse random regular graph contains man
 y more copies of K than expected?\n\npw 030303\n
LOCATION:https://researchseminars.org/talk/SCMSComb/27/
END:VEVENT
END:VCALENDAR