The conjugacy problem for the automorphism group of the random graph
This post is a link to https://arxiv.org/abs/0902.4038
With Paul Ellis and Scott Schneider. Archive for mathematical logic 50(1):215–221.
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.