# The conjugacy problem for the automorphism group of the random graph

With Paul Ellis and Scott Schneider. *Archive for mathematical logic*, 2011. (arχiv | journal)

Abstract: We prove that the conjugacy problem for the automorphism group of the random graph is Borel complete, and discuss the analogous problem for some other countably categorical structures.