Welcome to my St Andrews homepage. This page is under construction (and probably always will be!)
I am a halftime 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.
About me
On this site

Elsewhere

School of Mathematics and Statistics
University of St Andrews North Haugh St Andrews, Fife KY16 9SS SCOTLAND 
Tel.: +44 (0)1334 463769 Fax: +44 (0)1334 46 3748 Email: pjc20(at)starthurs(dot)ac(dot)uk [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 nonedges between X and its complement, leaving the other edges and nonedges 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 nontrivial 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.