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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d3ea8c4e03f
DTSTART;TZID=America/Toronto:20200717T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200717T133000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-nishad-kothari
SUMMARY:Combinatorial Optimization Reading Group - Nishad Kothari
CLASS:PUBLIC
DESCRIPTION:TITLE: Two unsolved problems: Birkhoff--von Neumann graphs an
 d\nPM-compact graphs\n\nSpeaker:\n Nishad Kothari\n\nAffiliation:\n CSE De
 partment\, Indian Institute of Technology Madras\n\nZoom:\n Contact Sharat
  Ibrahimpur\n\nABSTRACT:\n\nA well-studied object in combinatorial optimiz
 ation is the {\\it\nperfect matching polytope} $\\mathcal{PMP}(G)$ of a g
 raph $G$ --- the\nconvex hull of the incidence vectors of all perfect mat
 chings\nof $G$. A graph $G$ is {\\it Birkhoff--von Neumann} if\n$\\math
 cal{PMP}(G)$ is characterized solely by non-negativity and\ndegree constra
 ints\, and $G$ is {\\it PM-compact} if the combinatorial\ndiameter of $\\
 mathcal{PMP}(G)$ equals one.
DTSTAMP:20260406T171700Z
END:VEVENT
END:VCALENDAR