BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Matthew Kwan (Stanford University)
DTSTART:20210701T141500Z
DTEND:20210701T160000Z
DTSTAMP:20260422T070056Z
UID:CJCS/22
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/22/">Fr
 iendly bisections of random graphs</a>\nby Matthew Kwan (Stanford Universi
 ty) as part of Copenhagen-Jerusalem Combinatorics Seminar\n\n\nAbstract\nR
 esolving a conjecture of Füredi\, we prove that almost every n-vertex gra
 ph admits a partition of its vertex set into two parts of equal size in wh
 ich almost all vertices have more neighbours on their own side than across
 . Our proof involves some new techniques for studying processes driven by 
 degree information in random graphs\, which may be of general interest. Th
 is is joint work with Asaf Ferber\, Bhargav Narayanan\, Ashwin Sah and Meh
 taab Sawhney.\n
LOCATION:https://researchseminars.org/talk/CJCS/22/
END:VEVENT
END:VCALENDAR