Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/18764
Title: | Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs | Authors: | Kurilić Miloš Kuzeljević Boriša |
Issue Date: | 2014 | Journal: | Advances in Mathematics | Abstract: | For a countable ultrahomogeneous graph G=〈G,ρ〉 let P(G) denote the collection of sets A ∨ G such that 〈A,ρ∩[A]2〉≅G. The order types of maximal chains in the poset 〈P(G)∪{θ},∨〉 are characterized as:. (I) the order types of compact sets of reals having the minimum non-isolated, if G is the Rado graph or the Henson graph Hn, for some n ≥ 3;. (II) the order types of compact nowhere dense sets of reals having the minimum non-isolated, if G is the union of μ disjoint complete graphs of size ν, where μν = ω. © 2014 Elsevier Inc. | URI: | https://open.uns.ac.rs/handle/123456789/18764 | ISSN: | 0001-8708 | DOI: | 10.1016/j.aim.2014.07.011 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
4
checked on Aug 12, 2023
Page view(s)
16
Last Week
2
2
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.