Abstract
Let G be the group of order-preserving automorphisms of the rationals ℚ, or the group of colour-preserving automorphisms of the -coloured random graph
. We show that given any non-identity ƒ ∈ G, there exists g ∈ G such that every automorphism in G is the limit of a sequence of automorphisms generated by ƒ and g. Moreover, if, in some sense, ƒ has no finite structure, then g can be chosen with a great deal of flexibility.



















Comments (0)