The conjugacy problem for the automorphism group of the random graph

DOI10.1007/S00153-010-0210-YzbMATH Open1209.03039arXiv0902.4038OpenAlexW3099197730MaRDI QIDQ627441FDOQ627441

Authors: Samuel Coskey, Paul Ellis, Scott Schneider 

Publication date: 2 March 2011

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0902.4038

zbMATH Keywords

random graphBorel equivalence relationscategorical structure

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Categoricity and completeness of theories (03C35) Descriptive set theory (03E15)

Cites Work

• Title not available (Why is that?)
• A Borel reductibility theory for classes of countable structures
• Title not available (Why is that?)
• Borel equivalence relations and classifications of countable models
• Title not available (Why is that?)
• The completeness of the isomorphism relation for countable Boolean algebras
• The automorphism group of the random graph: four conjugates good, three conjugates better.
• The group of the countable universal graph
• The permutation group induced on a moiety

Cited In (6)

• Conjugacy for homogeneous ordered graphs
• The automorphism group of random graphs with a given number of edges
• On the disjointness problem for Gaussian automorphisms
• The conjugacy problem for automorphism groups of countable homogeneous structures
• Polish groups and Baire category methods
• On the classification of automorphisms of trees

This page was built for publication: The conjugacy problem for the automorphism group of the random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627441)