The group of the countable universal graph

DOI10.1017/S0305004100063428MaRDI QIDQ3712475zbMATH OpenOpenAlexFDO

Authors 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 permutation groupscycle typesinfinite simple groupscountable universal C-coloured graphcountable universal homogeneous graphset of colours

Mathematics Subject Classification ID

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

Recommendations

• The group of almost automorphisms of the countable universal graph
• Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph
• The automorphism group of the random graph: four conjugates good, three conjugates better.
• Universal \(H\)-colourable graphs
• On representing words in the automorphism group of the random graph

Cites work

• Finite axioms of choice

Cited in

(26)

• Automorphism groups of countable highly homogeneous partially ordered sets
• Homogeneous actions on the random graph
• A survey of homogeneous structures
• The countable character of uncountable graphs
• Henson graphs and Urysohn-Henson graphs as Cayley graphs
• Properties of the automorphism group and a probabilistic construction of a class of countable labeled structures
• Approximation of automorphisms of the rationals and the random graph.
• A family of universal pseudo-homogeneous \(G\)-colourable graphs
• Switching with more than two colours.
• On random relational structures
• Glasner's problem for Polish groups with metrizable universal minimal flow
• On representing words in the automorphism group of the random graph
• Generating infinite random graphs
• Cycle-types in the automorphism groups of countable homogeneous graphs
• Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph
• The group of almost automorphisms of the countable universal graph
• Infinite Paley graphs
• Algebraic systems whose elementary theory is compatible with an arbitrary group
• The ubiquity of free groups
• The automorphism group of the random graph: four conjugates good, three conjugates better.
• The structure of random automorphisms of the random graph
• Symmetrized induced Ramsey theory
• The conjugacy problem for the automorphism group of the random graph
• Simplicity of the automorphism groups of order and tournament expansions of homogeneous structures
• Infinite permutation groups. I: Products of conjugacy classes
• On automorphisms of the countable p.e.c. graph

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

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