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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf7a7d88752
DTSTART;TZID=America/Toronto:20250120T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250120T123000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-joannes-vermant
SUMMARY:Algebraic Graph Theory-Joannes Vermant
CLASS:PUBLIC
DESCRIPTION:TITLE: Cayley incidence graphs\n\nSPEAKER:\n Joannes Vermant\n\
 nAFFILIATION:\n Umeå University\n\nLOCATION:\n Please contact Sabrina La
 to for Zoom link.\n\nABSTRACT: Evra\, Feigon\, Maurischat\, and Parzanche
 vksi defined Cayley\nincidence graphs (which they refer to as Cayley bigra
 phs)\, a class of\nbiregular graphs used to construct bipartite expander g
 raphs. These\ngraphs are defined using a group G and a set of cells satisf
 ying\ncertain properties. Alternatively\, they can be described as the\nin
 cidence graphs of uniform and regular linear hypergraphs with a\ngroup G a
 cting regularly on the vertices. In this talk\, I will explore\nsome basic
  properties of Cayley incidence graphs\, as well as their\nconnections to 
 other combinatorial objects such as designs\, coset\ngeometries\, and diff
 erence sets.\n\nThis talk is based on joint work with Arnbjörg Soffía Á
 rnadóttir\,\nAlexey Gordeev\, Sabrina Lato\, and Tovohery Randrianarisoa.
DTSTAMP:20260403T082949Z
END:VEVENT
END:VCALENDAR