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:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e0f00b8a0f4
DTSTART;TZID=America/Toronto:20220215T160000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220215T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-chun-hung-liu
SUMMARY:Graphs and Matroids Seminar - Chun-Hung Liu
CLASS:PUBLIC
DESCRIPTION:TITLE: Homomorphism counts in robustly sparse graphs\n\nSpeake
 r:\n Chun-Hung Liu\n\nAffiliation:\n Texas A&M University\n\nZoom:\n Click
  here [http://http//matroidunion.org/?page_id=2477] or\nplease email Sh
 ayla Redlin\n\nABSTRACT:\n\nFor a fixed graph H and for arbitrarily large 
 host graphs G\, the\nnumber of homomorphisms from H to G and the number of
  subgraphs\nisomorphic to H contained in G have been extensively studied w
 hen the\nhost graphs are allowed to be dense.
DTSTAMP:20260416T141955Z
END:VEVENT
END:VCALENDAR