The conjugacy problem for the automorphism group of the random graph

DOI10.1007/S00153-010-0210-YzbMath1209.03039arXiv0902.4038OpenAlexW3099197730MaRDI QIDQ627441

Scott Schneider, Samuel Coskey, Paul Ellis

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

Borel equivalence relationscategorical structurerandom graph

Mathematics Subject Classification ID

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

Related Items (4)

The conjugacy problem for automorphism groups of countable homogeneous structures ⋮ Conjugacy for homogeneous ordered graphs ⋮ Polish groups and Baire category methods ⋮ On the classification of automorphisms of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The automorphism group of the random graph: four conjugates good, three conjugates better.
• A Borel reductibility theory for classes of countable structures
• The group of the countable universal graph
• The permutation group induced on a moiety
• The completeness of the isomorphism relation for countable Boolean algebras
• Borel equivalence relations and classifications of countable models

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