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:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ce92cb48022
DTSTART;TZID=America/Toronto:20260126T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260126T123000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-sebastian-cioaba-spectral-moore
SUMMARY:Algebraic Graph Theory-Sebastian Cioabă-Spectral Moore theorems fo
 r\ngraphs and hypergraphs
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Sebastian Cioabă\n\nAFFILIATION: \n\nUniversity of 
 Delaware\n\nLOCATION:\n Please contact Sabrina Lato for Zoom link.\n\nAB
 STRACT: The spectrum of a graph is closely related to many graph\nparamet
 ers. In particular\, the spectral gap of a regular graph which\nis the d
 ifference between its valency and second eigenvalue\, is widely\nseen an a
 lgebraic measure of connectivity and plays a key role in the\ntheory of ex
 pander and Ramanujan graphs. In this talk\, I will give an\noverview of re
 cent work studying the maximum order v(k\,\\theta)  of a\nregular graph (
 bipartite graph or hypergraph) of given valency k whose\nsecond largest ei
 genvalue is at most a given value \\theta. This\nproblem can be seen as a
  spectral Moore problem and has connections\nto Alon-Boppana theorems 
 for graphs and hypergraphs and with the\nusual Moore or degree-diameter 
 problem. 
DTSTAMP:20260402T160115Z
END:VEVENT
END:VCALENDAR