On representing words in the automorphism group of the random graph

DOI10.1515/JGT.2006.053zbMath1122.20015MaRDI QIDQ3413969

John K. Truss, Manfred Droste

Publication date: 5 January 2007

Published in: Journal of Group Theory (Search for Journal in Brave)

zbMATH Keywords

random graphsautomorphism groupsequations over groupsuniversal words

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generators, relations, and presentations of groups (20F05) Automorphism groups of groups (20F28) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Infinite automorphism groups (20B27)

Related Items (3)

Word equations in simple groups and polynomial equations in simple algebras. ⋮ Equations in simple matrix groups: algebra, geometry, arithmetic, dynamics. ⋮ Sets of universal sequences for the symmetric group and analogous semigroups

Cites Work

• Representations of Infinite Permutations by Words
• The group of the countable universal graph
• Representations of infinite permutations by words (II)
• Representation of order automorphisms by words

This page was built for publication: On representing words in the automorphism group of the random graph