The group of the countable universal graph

DOI10.1017/S0305004100063428zbMath0586.20004OpenAlexW2152178473MaRDI QIDQ3712475

John K. Truss

Publication date: 1985

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

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

zbMATH Keywords

infinite simple groupsinfinite permutation groupscycle typescountable universal C-coloured graphcountable universal homogeneous graphset of colours

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Simple groups (20E32) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Infinite automorphism groups (20B27)

Related Items (18)

Simplicity of the automorphism groups of order and tournament expansions of homogeneous structures ⋮ Approximation of automorphisms of the rationals and the random graph ⋮ The structure of random automorphisms of the random graph ⋮ Infinite permutation groups. I: Products of conjugacy classes ⋮ On random relational structures ⋮ Glasner's problem for Polish groups with metrizable universal minimal flow ⋮ The conjugacy problem for the automorphism group of the random graph ⋮ Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph ⋮ Switching with more than two colours. ⋮ Symmetrized induced Ramsey theory ⋮ Cycle-types in the automorphism groups of countable homogeneous graphs ⋮ The ubiquity of free groups ⋮ A survey of homogeneous structures ⋮ Homogeneous actions on the random graph ⋮ Infinite Paley graphs ⋮ Generating Infinite Random Graphs ⋮ On representing words in the automorphism group of the random graph ⋮ Automorphism groups of countable highly homogeneous partially ordered sets

Cites Work

• Finite axioms of choice

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