arXiv Analytics

Sign in

arXiv:0902.4038 [math.LO]AbstractReferencesReviewsResources

The conjugacy problem for the automorphism group of the random graph

Samuel Coskey, Paul Ellis, Scott Schneider

Published 2009-02-23, updated 2011-11-17Version 4

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.

Comments: 7 pages
Journal: Archive for Mathematical Logic (2011) 50(1):215--221
Categories: math.LO
Subjects: 03E15, 03C15, 05C80, 08A35
Related articles: Most relevant | Search more
arXiv:1410.6320 [math.LO] (Published 2014-10-23)
Copies of the Random Graph
arXiv:1904.05144 [math.LO] (Published 2019-04-10)
On the automorphism group of the universal homogeneous meet-tree
arXiv:0903.2553 [math.LO] (Published 2009-03-14, updated 2010-04-12)
All reducts of the random graph are model-complete

Links

Toolbox