pith. sign in

arxiv: 1305.7080 · v1 · pith:KDCHNZQJnew · submitted 2013-05-30 · 🧮 math.LO · math.CO

Maximal Chains of Isomorphic Subgraphs of Countable Ultrahomogeneous Graphs

classification 🧮 math.LO math.CO
keywords graphordertypeschainscompactcountablegraphshaving
0
0 comments X
read the original abstract

For a countable ultrahomogeneous graph G let P(G) denote the collection of domains of subgraphs of G isomorphic to G. The order types of maximal chains in the set P(G) U {\o} ordered by the inclusion 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 H_n, for some n>2; (II) the order types of compact nowhere dense sets of reals having the minimum non-isolated, if G is the union of \mu disjoint complete graphs of size \nu, where \mu \nu =\omega .

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.