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

DOI10.1016/j.apal.2016.04.001zbMath1432.03059arXiv1411.3144MaRDI 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

forcing; 2-localization; countable random graph; isomorphic substructure; right Green's pre-order; self-embedding

Mathematics Subject Classification ID

06A06: Partial orders, general

05C80: Random graphs (graph-theoretic aspects)

20M20: Semigroups of transformations, relations, partitions, etc.

03C50: Models with special properties (saturated, rigid, etc.)

03E40: Other aspects of forcing and Boolean-valued models

Related Items

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

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