The group of almost automorphisms of the countable universal graph

DOI10.1017/S0305004100067700MaRDI QIDQ4205621zbMATH OpenFDO

Authors John K. Truss

Publication date 1989

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

Full work available at URL https://doi.org/10.1017/S0305004100067700

zbMATH Keywords

normal subgroupsautomorphism groupssimple groupscycle typeshighly transitive groupsalmost automorphismscountable saturated structurescountable universal coloured graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Infinite automorphism groups (20B27)

Recommendations

• The group of the countable universal graph
• Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph
• Automorphism groups of countable highly homogeneous partially ordered sets
• On representing words in the automorphism group of the random graph
• scientific article; zbMATH DE number 17083

Cited in

(9)

• Automorphism groups of graph covers and uniform subset graphs
• Switching with more than two colours.
• The group of the countable universal graph
• Topological 2-generation of automorphism groups of countable ultrahomogeneous graphs
• On random relational structures
• On representing words in the automorphism group of the random graph
• A note on graphs with countable automorphism group
• Cyclic automorphisms of a countable graph and random sum-free sets
• Simplicity of some automorphism groups.

This page was built for publication: The group of almost automorphisms of the countable universal graph

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