BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Gabriel Verret (University of Auckland\, New Zealand)
DTSTART:20230919T200000Z
DTEND:20230919T210000Z
DTSTAMP:20260423T021136Z
UID:NTC/25
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/NTC/25/">Ver
 tex-transitive graphs with large automorphism groups</a>\nby Gabriel Verre
 t (University of Auckland\, New Zealand) as part of Lethbridge number theo
 ry and combinatorics seminar\n\nLecture held in University of Lethbridge: 
 M1060 (Markin Hall).\n\nAbstract\nMany results in algebraic graph theory c
 an be viewed as upper bounds on the size of the automorphism group of grap
 hs satisfying various hypotheses. These kinds of results have many applica
 tions. For example\, Tutte's classical theorem on 3-valent arc-transitive 
 graphs led to many other important results about these graphs\, including 
 enumeration\, both of small order and in the asymptotical sense. This natu
 rally leads to trying to understand barriers to this type of results\, nam
 ely graphs with large automorphism groups. We will discuss this\, especial
 ly in the context of vertex-transitive graphs of fixed valency. We will hi
 ghlight the apparent dichotomy between graphs with automorphism group of p
 olynomial (with respect to the order of the graph) size\, versus ones with
  exponential size.\n
LOCATION:https://researchseminars.org/talk/NTC/25/
END:VEVENT
END:VCALENDAR
