Document Type

Presentation Abstract

Presentation Date

10-12-2006

Abstract

Given a group G with generators Δ, it is well-known that the set of color-preserving automorphisms of the Cayley color digraph CayΔ(G) is isomorphic to G. Many people have studied the question of finding graphs (including Cayley graphs) with a given automorphism group G, the graphical regular representation problem. This talk asks a different question: how much larger than G can the full (digraph) automorphism group of a given Cayley graph for G be? The question doesn't have a complete answer yet, so we will survey results known so far. All of these concepts will be defined, and many lovely (and colorful) pictures will be shown.

Download the attached PDF file to see the abstract with an included image.

Additional Details

Thursday, 12 October 2006
4:10 p.m. in Math 109

Download

Share

COinS