BibTeX
CSL-JSON
MLA
Harvard
The conjugacy problem for the automorphism group of the random graph
release_xnvasrl7cnb5lbwgekr3dzgbfu
by
Samuel Coskey, Paul Ellis, Scott Schneider
Released
as a article
.
2009
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.
In text/plain
format
Archived Files and Locations
application/pdf 92.0 kB
file_6napkqhl4rhrdfksk7qsv3lqh4
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
0902.4038v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links