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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf77df9ec38
DTSTART;TZID=America/Toronto:20250505T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250505T123000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-venkata-raghu-tej-pantangi
SUMMARY:Algebraic Graph Theory-Venkata Raghu Tej Pantangi
CLASS:PUBLIC
DESCRIPTION:TITLE: Random analogues of Erd\\H{o}s-Ko-Rado type results.\n\
 nSPEAKER:\n\nVenkata Raghu Tej Pantangi\n\nLOCATION:\n Please contact Sab
 rina Lato for Zoom link.\n\nABSTRACT: The classical Erd\\H{o}s-Ko-Rado (
 EKR) theorem and its\nvariants can be translated into characterizing maxim
 um co-cliques of\ngraphs in Association schemes. For instance\, the classi
 cal\nErd\\H{o}s-Ko-Rado characterizes maximum co-cliques in the Kneser\ngr
 aph. Given a graph $G$\, by $G_{p}$\, we denote the random subgraph of\n$G
 $ in which edges appear independently\, each with a probability $p$.\nIn t
 his talk\, we consider the following question: for which\nprobabilities is
  the independence number of $G_{p}$ equal to that of\n$G$? Bollabas-Naraya
 nan-Raigorodskii investigated the independence\nnumbers of random subgraph
 s of the Kneser graph. In this talk\, we will\ninvestigate the independenc
 e numbers of random subgraphs of (i) the\nderangement graph on permutation
 s\; and (ii) the perfect matching\ngraphs. The derangement graph is associ
 ated with the EKR type result\non permutations and the perfect matching gr
 aph is associated with EKR\ntype result on perfect matchings. This is join
 t work with the members\nof the PIMS Collaborative Research Group on Movem
 ent and Symmetry in\ngraphs.   
DTSTAMP:20260403T081839Z
END:VEVENT
END:VCALENDAR