BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d2b63a2838f
DTSTART;TZID=America/Toronto:20210514T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210514T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-hao-huang
SUMMARY:Tutte Colloquium - Hao Huang
CLASS:PUBLIC
DESCRIPTION:TITLE: Interlacing methods in Extremal Combinatorics\n\nSpeake
 r:\n Hao Huang\n\nAffliliation:\n Emory University\n\nZoom:\n Contact Emm
 a Watson\n\nABSTRACT:\n\nExtremal Combinatorics studies how large or how s
 mall a collection of\nfinite objects could be\, if it must satisfy certain
  restrictions. In\nthis talk\, we will discuss applications of spectral gr
 aph theory\, more\nspecifically eigenvalue interlacing\, to prove various 
 interesting\nresults in Extremal Combinatorics. We will discuss the Erdos-
 Ko-Rado\nTheorem and its degree version\, an isodiametric inequality for\n
 discrete cubes\, and the resolution of a thirty-year-old open problem\nin 
 Theoretical Computer Science\, the Sensitivity Conjecture of Nisan\nand Sz
 egedy. Several open problems will also be mentioned during this\ntalk.
DTSTAMP:20260405T192130Z
END:VEVENT
END:VCALENDAR