The conjugacy problem for the automorphism group of the random graph

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.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…