Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/4574
Title: | The poset of all copies of the random graph has the 2-localization property | Authors: | Kurilić, Miloš Todorčević S. |
Issue Date: | 1-Aug-2016 | Journal: | Annals of Pure and Applied Logic | Abstract: | © 2016 Elsevier B.V. Let G be a countable graph containing a copy of the countable universal and homogeneous graph, also known as the random graph. Let Emb(G) be the monoid of self-embeddings of G, P(G)=(f[G]:f∈Emb(G)) the set of copies of G contained in G, and IG the ideal of subsets of G which do not contain a copy of G. We show that the poset 〈P(G),⊂〉, the algebra P(G)/IG, and the inverse of the right Green's pre-order 〈Emb(G), ≤R〉 have the 2-localization property. The Boolean completions of these pre-orders are isomorphic and satisfy the following law: for each double sequence [bnm:〈n, m〉∈ω×ω] of elements of B denotes the set of all binary subtrees of the tree ω<ω.. | URI: | https://open.uns.ac.rs/handle/123456789/4574 | ISSN: | 01680072 | DOI: | 10.1016/j.apal.2016.04.001 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
6
checked on May 10, 2024
Page view(s)
19
Last Week
7
7
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.