Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph
MetadataShow full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph R. As a consequence we show that, for any countable graph Γ, there are uncountably many maximal subgroups of the endomorphism monoid of R isomorphic to the automorphism group of Γ. Further structural information about End R is established including that Aut Γ arises in uncountably many ways as a Schützenberger group. Similar results are proved for the countable universal directed graph and the countable universal bipartite graph.
Dolinka , I , Gray , R D , McPhee , J D , Mitchell , J D & Quick , M 2016 , ' Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph ' , Mathematical Proceedings of the Cambridge Philosophical Society , vol. 160 , no. 3 , pp. 437-462 . https://doi.org/10.1017/S030500411500078X
Mathematical Proceedings of the Cambridge Philosophical Society
© 2016, Publisher / the Author(s). This work is made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at journals.cambridge.org / https://dx.doi.org/10.1017/S030500411500078X
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Showing items related by title, author, creator and subject.
Criterion of unrecognizability of a finite group by its Gruenberg–Kegel graph Cameron, Peter J.; Maslova, Natalia (2022-10-01) - Journal articleThe Gruenberg--Kegel graph Γ(G) associated with a finite group G is an undirected graph without loops and multiple edges whose vertices are the prime divisors of |G| and in which vertices p and q are adjacent in Γ(G) if ...
Tournaments and even graphs are equinumerous Royle, Gordon F.; Praeger, Cheryl E.; Glasby, S. P.; Freedman, Saul Daniel; Devillers, Alice (2022-12-29) - Journal articleA graph is called odd if there is an orientation of its edges and an automorphism that reverses the sense of an odd number of its edges and even otherwise. Pontus von Brömssen (né Andersson) showed that the existence of ...
Endomorphisms of Fraïssé limits and automorphism groups of algebraically closed relational structures McPhee, Jillian Dawn (University of St Andrews, 2012-11-30) - ThesisLet Ω be the Fraïssé limit of a class of relational structures. We seek to answer the following semigroup theoretic question about Ω. What are the group H-classes, i.e. the maximal subgroups, of End(Ω)? Fraïssé limits for ...