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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ce98f6bb970
DTSTART;TZID=America/Toronto:20241004T123000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20241004T133000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-rian-neogi-5
SUMMARY:C&O Reading Group - Rian Neogi
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Rian Neogi\n\nAFFILIATION:\n University of Waterloo\
 n\nLOCATION:\n MC 6029\n\nABSTRACT: In this talk\, we will cover the paper
  of Svensson and\nTarnawski that shows that perfect matching in general (n
 on-bipartite)\ngraphs in is quasi-NC. Similar to the work of Fenner\, Gurj
 ar and\nThierauf (covered earlier in the reading group)\, the approach is 
 to\nderandomize the isolation lemma for the perfect matching polytope by\n
 applying weight functions to iteratively restrict to subfaces of the\npoly
 tope. However\, the perfect matching polytope in general graphs is\nnot as
  well-structured as it is in bipartite graphs. The faces of the\npolytope 
 no longer correspond to subgraphs and now involve additional\ntight odd se
 t constraints that need to be dealt with. This makes it so\nthat a cycle w
 ith non-zero circulation may still exist in the support\nof the new face. 
 Additionally\, the existence of odd cycles in the\ngraph breaks the cycle 
 counting argument used in the paper of Fenner\,\nGurjar\, Thierauf. We wil
 l see how Svensson and Tarnawski deal with\nthese issues in the talk.
DTSTAMP:20260402T162734Z
END:VEVENT
END:VCALENDAR