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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682e35210d774
DTSTART;TZID=America/Toronto:20221128T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221128T150000
URL:/combinatorics-and-optimization/events/graphs-and-m
 atroid-seminar-hidde-koerts
SUMMARY:Graphs and Matroid Seminar - Hidde Koerts
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: _k-_Connectedness and _k_-Factors in the Se
 mi-Random Graph\nProcess\n\nSpeaker:\n Hidde Koerts\n\nAffiliation:\n Univ
 ersity of À¶Ý®ÊÓƵ\n\nLocation:\n MC 6029\n\nABSTRACT: The semi-random gr
 aph process is a single player graph game\nwhere the player is initially p
 resented an edgeless graph with n\nvertices. In each round\, the player is
  offered a vertex u uniformly at\nrandom and subsequently chooses a second
  vertex v deterministically\naccording to some strategy\, and adds edge uv
  to the graph. The\nobjective for the player is then to ensure that the gr
 aph fulfils some\nspecified property as fast as possible.\n 
DTSTAMP:20250521T201841Z
END:VEVENT
END:VCALENDAR