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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cea0fd47f35
DTSTART;TZID=America/Toronto:20200914T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200914T113000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-seminar-andriaherimanana-sarobidy
SUMMARY:Algebraic Graph Theory Seminar - Andriaherimanana Sarobidy\nRazafim
 ahatratra & Mahsa Nasrollahi Shirazi
CLASS:PUBLIC
DESCRIPTION:TITLE: Extensions of the Erdős-Ko-Rado theorem to 2-intersect
 ing\nperfect matchings and 2-intersecting permutations\n\nSpeakers:\n Andr
 iaherimanana Sarobidy Razafimahatratra & Mahsa Nasrollahi\nShirazi\n\nAffi
 liation:\n University of Regina\n\nZoom:\n Contact Soffia Arnadottir\n\nAB
 STRACT:\n\nThe Erdős-Ko-Rado (EKR) theorem is a classical result in extre
 mal\ncombinatorics. It states that if n and k are such that $n\\geq 2k$\,\
 nthen any intersecting family F of k-subsets of [n] = {1\,2\,...\,n} has\n
 size at most $\\binom{n-1}{k-1}$. Moreover\, if n>2k\, then equality\nhold
 s if and only if F is a canonical intersecting family\; that is\,\n$\\bigc
 ap_{A\\in F}A = \\{i\\}$\, for some i in [n].
DTSTAMP:20260402T170149Z
END:VEVENT
END:VCALENDAR