Welcome to my St Andrews homepage. This page is under construction (and probably always will be!)
I am a half-time Professor in the School of Mathematics and Statistics at the University of St Andrews, and an Emeritus Professor of Mathematics at Queen Mary, University of London.
The picture shows me at my retirement conference at Queen Mary.
On this site
School of Mathematics and Statistics
University of St Andrews
St Andrews, Fife KY16 9SS
Tel.: +44 (0)1334 463769
Fax: +44 (0)1334 46 3748
[oops – wrong saint!]
Page revised 4 August 2014
The operation of switching a graph with respect to a set X of vertices involves interchanging edges and non-edges between X and its complement, leaving the other edges and non-edges unchanged. This generates an equivalence relation on the set of graphs on a given vertex set, whose equivalence classes are switching classes.
It is known that, with just six exceptions, a non-trivial switching class with primitive automorphism group contains a graph with trivial automorphism group.
Problem: Is it true that such a switching class contains a graph with trivial endomorphism monoid, with finitely many exceptions?
Old problems are kept here.