Copies of the random graph

DOI10.1016/j.aim.2017.06.037zbMath1423.03189arXiv1410.6320OpenAlexW2963386921MaRDI QIDQ2014002

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

forcingpartial orderrandom graphisomorphic substructureself-embeddingright Green's preorder

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) Model theory of denumerable and separable structures (03C15)

Related Items

Antichains of copies of ultrahomogeneous structures ⋮ Posets of copies of countable non-scattered labeled linear orders ⋮ Different similarities ⋮ Forcing with copies of the Rado and Henson graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The poset of all copies of the random graph has the 2-localization property
• Posets of copies of countable scattered linear orders
• Forcing by non-scattered sets
• Maximal chains of isomorphic subgraphs of the Rado graph
• Different similarities
• Theory of relations. Transl. from the French by P. Clote
• FROM A1 TO D5: TOWARDS A FORCING-RELATED CLASSIFICATION OF RELATIONAL STRUCTURES
• Introduction to Ramsey Spaces (AM-174)
• Forcing with copies of countable ordinals
• Maximal antichains of isomorphic subgraphs of the Rado graph
• Universal graphs and universal functions
• A Partition Theorem
• The random graph
• Asymmetric graphs
• Multiple Forcing