Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph

DOI10.1017/S030500411500078XzbMath1371.05120arXiv1408.4107OpenAlexW2262626319MaRDI QIDQ5360382

Robert D. Gray, Jillian D. McPhee, Martyn Quick, Igor Dolinka, James D. Mitchell

Publication date: 28 September 2017

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (1)

Permutation monoids and MB-homogeneity for graphs and relational structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simplicity of some automorphism groups.
• Groups represented by homeomorphism groups. I
• Graphs with given infinite group
• The monoid of the random graph
• Infinite homogeneous bipartite graphs with unequal sides
• A characterization of retracts in certain Fraïssé limits
• The Bergman property for endomorphism monoids of some Fraïssé limits
• Homomorphism-Homogeneous Relational Structures
• The group of the countable universal graph
• Green's Relations for Regular Elements of Semigroups of Endomorphisms
• The random graph

This page was built for publication: Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph