The conjugacy problem for the automorphism group of the random graph

Details The conjugacy problem for the automorphism group of the random graph The conjugacy problem for the automorphism group of the random graph

2009-02-23

arxiv.org/abs/0902.4038v4

Archive for Mathematical Logic (2011) 50(1):215--221

Mathematics

Logic

7 pages

Scientific paper

10.1007/s00153-010-0210-y

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.

Affiliated with

Also associated with

No associations

Rating

The conjugacy problem for the automorphism group of the random graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The conjugacy problem for the automorphism group of the random graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The conjugacy problem for the automorphism group of the random graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-171709