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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6ad06507d00b8
DTSTART;TZID=America/Toronto:20261019T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261019T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-emanuel-juliano-morais-silva-connection
SUMMARY:Graphs and Matroids | Emanuel Juliano Morais Silva\, On the connect
 ion\nbetween max-cuts\, the vector chromatic number\, and random sphere\ng
 raphs
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Emanuel Juliano Morais Silva\n\nAFFILIATION:\n Unive
 rsity of Waterloo\n\nROOM:\n MC 6029\n\nABSTRACT: It is well known that t
 he maximum cut size of a graph is at\nleast half its number of edges. But 
 how small can this difference be?\nUsing random hyperplane rounding\, a te
 chnique from semidefinite\noptimization\, Balla\, Janzer\, and Sudakov obt
 ained a lower bound on\nthis difference in terms of the vector chromatic n
 umber\, recovering\nknown extremal bounds for $C_r$-free graphs. I will pr
 esent their\nargument and show that the constant in their vector-chromatic
  bound is\noptimal by constructing a random sphere graph.
DTSTAMP:20261015T053047Z
END:VEVENT
END:VCALENDAR