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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d0d140a26c2
DTSTART;TZID=America/Toronto:20231207T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231207T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-amitha-vallapuram
SUMMARY:Graphs and Matroids Seminar - Amitha Vallapuram
CLASS:PUBLIC
DESCRIPTION:TITLE: The Container method for Enumerating Triangle-free graph
 s\n\nSPEAKER:\n Amitha Vallapuram\n\nAFFILIATION:\n University of Waterloo
 \n\nLOCATION:\n MC 5417\n\nABSTRACT: The container method is a tool for bo
 unding the number of\nindependent sets in graphs and can be generalized to
  hypergraphs. It\nutilizes the observation that independent sets are found
  in clusters\nor “containers” within the graph. One application of thi
 s method\nis to bound the number of finite objects with some forbidden\nsu
 bstructure. For example\, we can bound the number of graphs on N\nvertices
  that do not contain K3 as a subgraph\, that is\, the number of\nTriangle
 -free graphs on N vertices. We will take a look at finding\nthis bound usi
 ng the container method.
DTSTAMP:20260404T085216Z
END:VEVENT
END:VCALENDAR