The conjugacy problem for the automorphism group of the random graph
Logic
2019-08-16 v4
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.
Cite
@article{arxiv.0902.4038,
title = {The conjugacy problem for the automorphism group of the random graph},
author = {Samuel Coskey and Paul Ellis and Scott Schneider},
journal= {arXiv preprint arXiv:0902.4038},
year = {2019}
}
Comments
7 pages