Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs

Abstract

Abstract A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random graph, infinite disjoint unions of complete graphs K n {K_{n}} with n ∈ ℕ {n\in\mathbb{N}} vertices, the K n {K_{n}} -free graphs, finite unions of the infinite complete graph K ω {K_{\omega}} , and duals of such graphs. The groups Aut ⁡ ( Γ ) {\operatorname{Aut}(\Gamma)} of automorphisms of such graphs Γ have a natural topology, which is compatible with multiplication and inversion, i.e. the groups Aut ⁡ ( Γ ) {\operatorname{Aut}(\Gamma)} are topological groups. We consider the problem of finding minimally generated dense subgroups of the groups Aut ⁡ ( Γ ) {\operatorname{Aut}(\Gamma)} where Γ is ultrahomogeneous. We show that if Γ is ultrahomogeneous, then Aut ⁡ ( Γ ) {\operatorname{Aut}(\Gamma)} has 2-generated dense subgroups, and that under certain conditions given f ∈ Aut ⁡ ( Γ ) {f\in\operatorname{Aut}(\Gamma)} there exists g ∈ Aut ⁡ ( Γ ) {g\in\operatorname{Aut}(\Gamma)} such that the subgroup generated by f and g is dense. We also show that, roughly speaking, g can be chosen with a high degree of freedom. For example, if Γ is either an infinite disjoint union of K n {K_{n}} or a finite union of K ω {K_{\omega}} , then g can be chosen to have any given finite set of orbit representatives.