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:69d2a20f5da33
DTSTART;TZID=America/Toronto:20230724T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230724T113000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-hendrik-van-maldeghem
SUMMARY:Algebraic Graph Theory - Hendrik Van Maldeghem
CLASS:PUBLIC
DESCRIPTION:TITLE: Geometric approach to some rank 3 graphs\n\nSPEAKER:\n H
 endrik Van Maldeghem\n\nAFFILIATION:\n Ghent University\n\nLOCATION:\n Ple
 ase contact Sabrina Lato for Zoom link\n\nABSTRACT: Rank 3 graphs are gr
 aphs whose full automorphism group acts\nas a rank 3 group on the vertices
 . Finite rank 3 groups are classified\nand hence finite rank 3 graphs are 
 classified. The main examples arise\nfrom geometric structures such as pro
 jective and polar spaces\, and\nthere is one class of examples related to 
 the exceptional groups of\ntype E6. We present a combinatorial/geometric/p
 rojective construction\nof these graphs.  We then consider a class of reg
 ular sets\, that is\,\nsubsets S of the vertices such that the number of v
 ertices of S\nadjacent to some vertex v only depends on whether v belongs 
 to S or\nnot. We will explain how this leads to characterizations of certa
 in\nautomorphisms of the E6 graphs and other graphs.
DTSTAMP:20260405T175527Z
END:VEVENT
END:VCALENDAR