Approximation of automorphisms of the rationals and the random graph

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

Udayan B. Darji, James D. Mitchell

Publication date: 17 October 2011

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

Full work available at URL: https://doi.org/10.1515/jgt.2010.057

zbMATH Keywords

random graphPolish groupstopological generatorsorder-preserving automorphisms

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Complete metric spaces (54E50) Generators, relations, and presentations of groups (20F05) Topological groups (topological aspects) (54H11) Infinite automorphism groups (20B27)

Related Items (4)

Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs ⋮ Dense free subgroups of automorphism groups of homogeneous partially ordered sets ⋮ Automorphism groups of finite topological rank ⋮ Generating Infinite Random 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

This page was built for publication: Approximation of automorphisms of the rationals and the random graph