Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs

From MaRDI portal
Publication:2363345

DOI10.1515/FORUM-2016-0056zbMATH Open1367.05104arXiv1602.05766OpenAlexW2962680658MaRDI QIDQ2363345FDOQ2363345


Authors: J. Jonušas, J. D. Mitchell Edit this on Wikidata


Publication date: 13 July 2017

Published in: Forum Mathematicum (Search for Journal in Brave)

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 Kn with ninmathbbN vertices; the Kn-free graphs; finite unions of the infinite complete graph Komega; and duals of such graphs. The groups operatornameAut(Gamma) of automorphisms of such graphs Gamma have a natural topology, which is compatible with multiplication and inversion, i.e. the groups operatornameAut(Gamma) are topological groups. We consider the problem of finding minimally generated dense subgroups of the groups operatornameAut(Gamma) where Gamma is ultrahomogeneous. We show that if Gamma is ultrahomogeneous, then operatornameAut(Gamma) has 2-generated dense subgroups, and that under certain conditions given finoperatornameAut(Gamma) there exists ginoperatornameAut(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 Gamma is either an infinite disjoint unions of Kn or a finite union of Komega, then g can be chosen to have any given finite set of orbit representatives.


Full work available at URL: https://arxiv.org/abs/1602.05766




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363345)