BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Hao Huang (Emory University)
DTSTART:20201228T030000Z
DTEND:20201228T034500Z
DTSTAMP:20260423T041343Z
UID:iccm2020/35
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/iccm2020/35/
 ">Interlacing methods in Extremal Combinatorics</a>\nby Hao Huang (Emory U
 niversity) as part of ICCM 2020\n\n\nAbstract\nExtremal Combinatorics stud
 ies how large or how small a collection of finite objects could be\, if it
  has to satisfy certain restrictions. In this talk\, we will discuss how e
 igenvalue interlacing leads to various interesting results in Extremal Com
 binatorics\, including the Erdos-Ko-Rado Theorem and its degree version\, 
 an isodiametric inequality for discrete cubes\, and the resolution of a th
 irty-year-old open problem in Theoretical Computer Science\, the Sensitivi
 ty Conjecture.\n
LOCATION:https://researchseminars.org/talk/iccm2020/35/
END:VEVENT
END:VCALENDAR