Copies of the random graph

DOI10.1016/J.AIM.2017.06.037MaRDI QIDQ2014002zbMATH OpenOpenAlexFDO

Authors Miloš S. Kurilić, Stevo Todorčević

Publication date 10 August 2017

Published in Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random graphpartial orderforcingisomorphic substructureself-embeddingright Green's preorder

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Partial orders, general (06A06) Models with special properties (saturated, rigid, etc.) (03C50) Semigroups of transformations, relations, partitions, etc. (20M20) Other aspects of forcing and Boolean-valued models (03E40) Model theory of denumerable and separable structures (03C15)

Abstract: Let $(R,sim)$ be the Rado graph, $Emb(R)$ the monoid of its self-embeddings, $Pi(R)=f[R]:finEmb(R)$ the set of copies of $R$ contained in $R$, and ${mathcalI}_R$ the ideal of subsets of $R$ which do not contain a copy of $R$. We consider the poset $(Pi(R),subset)$, the algebra $P(R)/mathcal{I}_R$, and the inverse of the right Green's pre-order on $Emb(R)$, and show that these pre-orders are forcing equivalent to a two step iteration of the form $Pastpi$, where the poset $P$ is similar to the Sacks perfect set forcing: adds a generic real, has the $alep{h}_0$-covering property and, hence, preserves $omeg{a}_1$, has the Sacks property and does not produce splitting reals, while $pi$ codes an $omega$-distributive forcing. Consequently, the Boolean completions of these four posets are isomorphic and the same holds for each countable graph containing a copy of the Rado graph.

Recommendations

• The poset of all copies of the random graph has the 2-localization property
• scientific article; zbMATH DE number 5938867
• Maximal antichains of isomorphic subgraphs of the Rado graph
• Maximal chains of isomorphic subgraphs of the Rado graph
• On retracts of the random graph and their natural order

Cites work

• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 1062123 (Why is no real title available?)
• A Partition Theorem
• Asymmetric graphs
• Different similarities
• Forcing by non-scattered sets
• Forcing with copies of countable ordinals
• From \(A_{1}\) to \(D_{5}\): towards a forcing-related classification of relational structures
• Introduction to Ramsey space
• Maximal antichains of isomorphic subgraphs of the Rado graph
• Maximal chains of isomorphic subgraphs of the Rado graph
• Multiple Forcing
• Posets of copies of countable scattered linear orders
• The poset of all copies of the random graph has the 2-localization property
• The random graph
• Theory of relations. Transl. from the French by P. Clote
• Universal graphs and universal functions

Cited in

(7)

• The partial duplication random graph with edge deletion
• Posets of copies of countable ultrahomogeneous tournaments
• The poset of all copies of the random graph has the 2-localization property
• Different similarities
• Forcing with copies of the Rado and Henson graphs
• Antichains of copies of ultrahomogeneous structures
• Posets of copies of countable non-scattered labeled linear orders

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

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