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:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e3ed46b4c96
DTSTART;TZID=America/Toronto:20231026T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231026T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-dao-chen-yuan
SUMMARY:Graphs and Matroids Seminar - Dao Chen Yuan
CLASS:PUBLIC
DESCRIPTION:TITLE: Chromatic Number of Random Signed Graphs\n\nSPEAKER:\n D
 ao Chen Yuan\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n MC 54
 17\n\nABSTRACT: A signed graph is a graph where edges are labelled {+1\,-1
 }.\nA signed colouring in 2k colours maps the vertices of a signed graph\n
 to {-k\,...\,-1\,1\,...\,k}\, such that neighbours joined by a positive ed
 ge\ndo not share the same colour\, and those joined by a negative edge do\
 nnot share opposite colours. It is a classical result that the\nchromatic 
 number of a G(n\,p) Erdos-Renyi random graph is\nasymptotically almost sur
 ely n/(2log_b(n))\, where p is constant and\nb=1/(1-p). We extend the meth
 od used there to prove that the chromatic\nnumber of a G(n\,p\,q) random s
 igned graph\, where q is the probability\nthat an edge is labelled -1\, is
  also a.a.s. n/(2log_b(n))\, if p is\nconstant and q=o(1).
DTSTAMP:20260418T204454Z
END:VEVENT
END:VCALENDAR