On distance transitive graphs

Jan Saxl

University of Cambridge

October 29,
refreshments at 3:45pm


A graph is distance transitive if given two pairs of vertices at the same distance, there exists an automorphism taking the first pair to the second. There are many interesting examples. There is an ongoing project to classify finite distance transitive graphs. A closely related problem is concerned with permutation representations of groups in which all the irreducible constituents are distinct (also known as Gelfand pairs). The talk will report on some of the steps in these projects.

Speaker's Contact Info: J.Saxl(at-sign)dpmms.cam.ac.uk

Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)math.mit.edu

Page loaded on September 18, 2003 at 11:16 AM. Copyright © 1998-99, Sara C. Billey. All rights reserved.