The group of the countable universal graph
From MaRDI portal
Publication:3712475
DOI10.1017/S0305004100063428zbMath0586.20004MaRDI QIDQ3712475
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
infinite simple groups; infinite permutation groups; cycle types; countable universal C-coloured graph; countable universal homogeneous graph; set of colours
03C60: Model-theoretic algebra
20E32: Simple groups
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C15: Coloring of graphs and hypergraphs
20B27: Infinite automorphism groups
Related Items
Infinite Paley graphs, Generating Infinite Random Graphs, Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph, The conjugacy problem for the automorphism group of the random graph, Symmetrized induced Ramsey theory, Simplicity of the automorphism groups of order and tournament expansions of homogeneous structures, Infinite permutation groups. I: Products of conjugacy classes, The ubiquity of free groups, Automorphism groups of countable highly homogeneous partially ordered sets, On random relational structures, Switching with more than two colours., Homogeneous actions on the random graph, The structure of random automorphisms of the random graph, A survey of homogeneous structures, Glasner's problem for Polish groups with metrizable universal minimal flow, Cycle-types in the automorphism groups of countable homogeneous graphs, Approximation of automorphisms of the rationals and the random graph, On representing words in the automorphism group of the random graph
Cites Work
