The poset of all copies of the random graph has the 2-localization property

DOI10.1016/j.apal.2016.04.001zbMath1432.03059arXiv1411.3144OpenAlexW2337591713MaRDI QIDQ286593

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

Publication date: 20 May 2016

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

forcing2-localizationcountable random graphisomorphic substructureright Green's pre-orderself-embedding

Mathematics Subject Classification ID

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

Related Items

The poset of all copies of the random graph has the 2-localization property ⋮ Antichains of copies of ultrahomogeneous structures ⋮ Posets of copies of countable non-scattered labeled linear orders ⋮ Different similarities ⋮ Indivisible sets and well‐founded orientations of the Rado graph ⋮ Forcing with copies of the Rado and Henson graphs ⋮ Copies of the random graph

Cites Work

• Unnamed Item
• The poset of all copies of the random graph has the 2-localization property
• Maximally embeddable components
• Posets of copies of countable scattered linear orders
• Forcing by non-scattered sets
• Different similarities
• Isomorphic and strongly connected components
• FROM A1 TO D5: TOWARDS A FORCING-RELATED CLASSIFICATION OF RELATIONAL STRUCTURES
• n–localization property
• The Ideal Determined by the Unsymmetric Game
• Forcing with copies of countable ordinals
• Universal graphs and universal functions
• The random graph
• Asymmetric graphs