The conjugacy problem for the automorphism group of the random graph

DOI10.1007/S00153-010-0210-YMaRDI QIDQ627441zbMATH OpenOpenAlexFDO

Authors Samuel Coskey, Paul Ellis, Scott Schneider

Publication date 2 March 2011

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

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)

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.

Cites work

• scientific article; zbMATH DE number 3741468 (Why is no real title available?)
• scientific article; zbMATH DE number 976831 (Why is no real title available?)
• scientific article; zbMATH DE number 1522814 (Why is no real title available?)
• A Borel reductibility theory for classes of countable structures
• Borel equivalence relations and classifications of countable models
• The automorphism group of the random graph: four conjugates good, three conjugates better.
• The completeness of the isomorphism relation for countable Boolean algebras
• The group of the countable universal graph
• The permutation group induced on a moiety

Cited in

(5)

• On the disjointness problem for Gaussian automorphisms
• Polish groups and Baire category methods
• Conjugacy for homogeneous ordered graphs
• The automorphism group of random graphs with a given number of edges
• 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)