Reducts of the random graph

DOI10.2307/2274912MaRDI QIDQ3981452zbMATH OpenOpenAlexFDO

Authors Simon Thomas

Publication date 26 June 1992

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2274912

zbMATH Keywords

graph isomorphismpermutation groupsubgroup

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Random graphs (graph-theoretic aspects) (05C80) Subgroups of symmetric groups (20B35)

Recommendations

• Reducts of the random bipartite graph
• The 42 reducts of the random ordered graph
• Reducts of random hypergraphs
• scientific article; zbMATH DE number 3893250

Cites work

• The Ramsey property for graphs with forbidden complete subgraphs

Cited in

(37)

• Strongly determined types
• The automorphism group of the random graph: four conjugates good, three conjugates better.
• Switching with more than two colours.
• A census of infinite distance-transitive graphs
• On retracts of the random graph and their natural order
• Infinitely many reducts of homogeneous structures
• Reducts of random hypergraphs
• Reducts of the random bipartite graph
• Minimal functions on the random graph
• Ramsey degrees: big v. small
• Permutation groups with small orbit growth
• Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting)
• A survey of homogeneous structures
• The affine and projective groups are maximal
• The 42 reducts of the random ordered graph
• A locally finite dense group acting on the random graph
• scientific article; zbMATH DE number 6500579 (Why is no real title available?)
• On representing words in the automorphism group of the random graph
• A Theorem on Reconstruction of Random Graphs
• \(2^{\aleph_{0}}\) pairwise nonisomorphic maximal-closed subgroups of \(\mathrm{Sym}(\mathbb N)\) via the classification of the reducts of the Henson digraphs
• Reducts of the random partial order
• Permutations on the random permutation
• Overgroups of the automorphism group of the Rado graph
• Equations in oligomorphic clones and the constraint satisfaction problem for \(\omega \)-categorical structures
• Permutation groups containing infinite symplectic linear groups and reducts of linear spaces over the two element field
• EPPA for two-graphs and antipodal metric spaces
• Constraint satisfaction problems for reducts of homogeneous graphs
• Reducts of the Henson graphs with a constant
• Functional reducts of the countable atomless Boolean algebra
• More sublattices of the lattice of local clones
• The lattice of definability: origins, recent developments, and further directions
• Smooth approximations and CSPs over finitely bounded homogeneous structures
• EPPA numbers of graphs
• An order out of nowhere: a new algorithm for infinite-domain CSPs
• Smooth approximations: an algebraic approach to CSPs over finitely bounded homogeneous structures
• Automorphisms of homogeneous structures
• Reducts of the generic digraph

This page was built for publication: Reducts of the random graph

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