BEGIN:VCALENDAR
CALSCALE:GREGORIAN
VERSION:2.0
METHOD:PUBLISH
PRODID:-//Drupal iCal API//EN
X-WR-TIMEZONE:America/New_York
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
DTSTART:20070311T020000
TZNAME:EDT
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
DTSTART:20071104T020000
TZNAME:EST
TZOFFSETTO:-0500
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:1
X-APPLE-TRAVEL-ADVISORY-BEHAVIOR:AUTOMATIC
UID:224876
DTSTAMP:20251003T084754Z
DTSTART;TZID=America/New_York:20251007T160000
DTEND;TZID=America/New_York:20251007T170000
URL;TYPE=URI:https://wpiedudev.wpi.edu/news/calendar/events/department-math
 ematical-sciences-discrete-math-seminar-alena-ernst-wpi
SUMMARY:Department of Mathematical Sciences Discrete Math Seminar: Alena Er
 nst, WPI
DESCRIPTION:\n\n\n      \n\n\n\nDepartment of Mathematical Sciences\nDiscre
 te Math Seminar\nTuesday, October 7th, 2025\n4:00PM-4:50PM\nOlin Hall 126\
 nSpeaker: Alena Ernst, WPI\nTitle: An Introduction to the World of Erdős–K
 o–Rado Problems\nAbstract: Two of the most famous problems in combinatoric
 s are as follows: How large can a family of k-sets of {1,2,…,n} be such th
 at every two members of the family have a non-empty intersection? And what
  is the characterisation of the families of maximal size?These are the cla
 ssical examples of a class of combinatorial problems known as intersecting
  problems. They are also called Erdős-Ko-Rado (EKR) problems, in honour of
  the mathematicians who first proposed and solved them. In this talk, we i
 ntroduce the world of EKR problems: we explore a variety of objects, notio
 ns of intersection, and proof techniques.\n
END:VEVENT
END:VCALENDAR