Approximation of automorphisms of the rationals and the random graph

DOI10.1515/JGT.2010.057zbMath1235.20002MaRDI QIDQ3174588

Udayan B. Darji, James D. Mitchell

Publication date: 17 October 2011

Published in: Journal of Group Theory (Search for Journal in Brave)

zbMATH Keywords

random graph; Polish groups; topological generators; order-preserving automorphisms

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

54E50: Complete metric spaces

20F05: Generators, relations, and presentations of groups

54H11: Topological groups (topological aspects)

20B27: Infinite automorphism groups

Related Items

Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs

Cites Work

• Les beaux automorphismes. (The beautiful automorphisms)
• Extending partial isometries
• Generic automorphisms of the universal partial order
• The Small Index Property for Free Groups and Relatively Free Groups
• Generic Automorphisms of Homogeneous Structures
• Generically there is but one self homeomorphism of the Cantor set
• The group of the countable universal graph
• GROUPS OF AUTOMORPHISMS OF N₀-CATEGORICAL STRUCTURES
• Most Finitely Generated Permutation Groups are Free
• The Small Index Property for ω‐Stable ω‐Categorical Structures and for the Random Graph
• UBIQUITY OF FREE SUBGROUPS
• Highly transitive subgroups of the symmetric group on the natural numbers