We consider the complexity of the isomorphism relation on countable first-order structures with transitive automorphism groups. We use the theory of Borel reducibility of equivalence relations to show that the isomorphism problem for vertex-transitive graphs is as complicated as the isomorphism problem for arbitrary graphs and determine for which first-order languages the isomorphism problem for transitive countable structures is as complicated as it is for arbitrary countable structures. We then use these results to characterize the complexity of the isometry relation for certain classes of homogeneous and ultrahomogeneous metric spaces.
"Isomorphism of Homogeneous Structures." Notre Dame J. Formal Logic 50 (1) 1 - 22, 2009. https://doi.org/10.1215/00294527-2008-024