Overgroups of the Automorphism Group of the Rado Graph

DOI10.1007/978-1-4614-6406-8_4zbMATH Open1266.05052arXiv1205.3717OpenAlexW1526916601MaRDI QIDQ4928664FDOQ4928664

Claude Laflamme, Maurice Pouzet, Sam Tarzi, Peter J. Cameron, R. E. Woodrow

Publication date: 17 June 2013

Published in: Asymptotic Geometric Analysis (Search for Journal in Brave)

Abstract: We are interested in overgroups of the automorphism group of the Rado graph. One class of such overgroups is completely understood; this is the class of reducts. In this article we tie recent work on various other natural overgroups, in particular establishing group connections between them and the reducts.

Full work available at URL: https://arxiv.org/abs/1205.3717

zbMATH Keywords

automorphism grouphomogeneous structuresRado graphovergroup

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Infinite graphs (05C63) Hypergraphs (05C65) Automorphism groups of groups (20F28)

Cites Work

• Title not available (Why is that?)
• Minimal functions on the random graph
• Reducts of random hypergraphs
• Reducts of the random graph
• Invariant subsets of scattered trees and the tree alternative property of Bonato and Tardif

Cited In (2)

• Forcing with copies of the Rado and Henson graphs
• Posets of copies of countable non-scattered labeled linear orders

This page was built for publication: Overgroups of the Automorphism Group of the Rado Graph

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