Location: Room VG25, Mathematics Building (Callaghan Campus) The University of Newcastle
Time and Date:3:00 pm, Mon, 17th Oct 2016
Konig (1936) asked whether every finite group G is realized as the automorphism group of a graph. Frucht answered the question in the affirmative and his answer involved graphs whose orders were substantially bigger than the orders of the groups leading to the question of finding the smallest graph with a fixed automorphism group. We shall discuss some of the early work on this problem and some recent results for the family of dihedral groups.