Maximal Chains of Isomorphic Subgraphs of Countable Ultrahomogeneous Graphs

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 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 Hn, 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 μ disjoint complete graphs of size , where μ =ω .

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…